[HTML][HTML] Evacuation route planning for alternative fuel vehicles

DSD Purba, E Kontou, C Vogiatzis - Transportation research part C …, 2022 - Elsevier
As the number of adopted alternative fuel vehicles increases, it is crucial for communities
(especially those that are susceptible to hazards) to make evacuation plans that account for …

Multiperiod location-routing with decoupled time scales

M Albareda-Sambola, E Fernández, S Nickel - European journal of …, 2012 - Elsevier
This paper focuses on a multiperiod discrete facility location problem where transportation
costs are considered together with location costs to design the operating facility pattern …

Layered graph approaches for combinatorial optimization problems

L Gouveia, M Leitner, M Ruthmair - Computers & Operations Research, 2019 - Elsevier
Extending the concept of time-space networks, layered graphs associate information about
one or multiple resource state values with nodes and arcs. While integer programming …

Optimal relay node placement in delay constrained wireless sensor network design

A Nigam, YK Agarwal - European Journal of Operational Research, 2014 - Elsevier
Abstract The Delay Constrained Relay Node Placement Problem (DCRNPP) frequently
arises in the Wireless Sensor Network (WSN) design. In WSN, Sensor Nodes are placed …

Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation

A Konak - European Journal of Operational Research, 2012 - Elsevier
The network design problem with relays arises in telecommunications and distribution
systems where the payload must be reprocessed at intermediate stations called relays on …

Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem

L Gouveia, M Leitner, M Ruthmair - European Journal of Operational …, 2017 - Elsevier
In this paper we study Integer Linear Programming models and develop branch-and-cut
algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP)(Bourgeois …

Solution of minimum spanning forest problems with reliability constraints

IK Ahani, M Salari, SM Hosseini, M Iori - Computers & Industrial …, 2020 - Elsevier
We propose the reliability constrained k-rooted minimum spanning forest, a relevant
optimization problem whose aim is to find a k-rooted minimum cost forest that connects …

A voltage drop limited decentralized electric power distribution network

K Gokbayrak, H Avci - Computers & Operations Research, 2020 - Elsevier
We consider a decentralized electric power distribution network design problem in rural
areas with no existing infrastructure. While the source facilities can be located anywhere on …

Hop constrained Steiner trees with multiple root nodes

L Gouveia, M Leitner, I Ljubić - European Journal of Operational Research, 2014 - Elsevier
We consider a network design problem that generalizes the hop and diameter constrained
Steiner tree problem as follows: Given an edge-weighted undirected graph with two disjoint …

Exact approaches for network design problems with relays

M Leitner, I Ljubić, M Riedler… - INFORMS Journal on …, 2019 - pubsonline.informs.org
In this article we consider the network design problem with relays (NDPR), which gives
answers to some important strategic design questions in telecommunication network design …