The Experts below are selected from a list of 327 Experts worldwide ranked by ideXlab platform
Eleni Vlahogianni - One of the best experts on this subject based on the ideXlab platform.
-
Metaheuristics for the transit route network Design Problem: a review and comparative analysis
Public Transport, 2019Co-Authors: Christina Iliopoulou, Konstantinos Kepaptsoglou, Eleni VlahogianniAbstract:This paper critically reviews applications of metaheuristics for solving the Transit Route Network Design Problem (TRNDP). A structured review is offered and prominent metaheuristics for tackling the TRNDP are evaluated, according to a benchmark network. The review findings yield a unified implementation framework, which contains common algorithmic components and different solution representations and methods, which are considered important for obtaining solutions of good quality. The paper concludes with identified gaps in research and opportunities for future research on the application of metaheuristic algorithms for solving the TRNDP.
Sebastian Linser - One of the best experts on this subject based on the ideXlab platform.
-
EvoWorkshops - A study of an iterated local search on the reliable communication networks Design Problem
Lecture Notes in Computer Science, 2005Co-Authors: Dirk Reichelt, Peter Gmilkowsky, Sebastian LinserAbstract:The reliability of network topologies is an important key issue for business success. This paper investigates the reliable communication network Design Problem using an iterated local search (ILS) method. This paper demonstrates how the concepts of local search (LS) and iterated local search can be applied to this Design Problem. A new neighborhood move that finds cheaper networks without violating the reliability constraint is proposed. Empirical results show that the ILS method is more efficient than a genetic algorithm.
David Z W Wang - One of the best experts on this subject based on the ideXlab platform.
-
a novel discrete network Design Problem formulation and its global optimization solution algorithm
Transportation Research Part E-logistics and Transportation Review, 2015Co-Authors: David Z W Wang, W Y SzetoAbstract:Conventional discrete transportation network Design Problem deals with the optimal decision on new link addition, assuming the capacity of each candidate link addition is predetermined and fixed. In this paper, we address a novel yet general discrete network Design Problem formulation that aims to determine the optimal new link addition and their optimal capacities simultaneously, which answers the questions on whether a new link should be added or not, and if added, what should be the optimal link capacity. A global optimization method employing linearization, outer approximation and range reduction techniques is developed to solve the formulated model.
-
global optimization method for network Design Problem with stochastic user equilibrium
Transportation Research Part B-methodological, 2015Co-Authors: David Z W WangAbstract:In this paper, we consider the continuous road network Design Problem with stochastic user equilibrium constraint that aims to optimize the network performance via road capacity expansion. The network flow pattern is subject to stochastic user equilibrium, specifically, the logit route choice model. The resulting formulation, a nonlinear nonconvex programming Problem, is firstly transformed into a nonlinear program with only logarithmic functions as nonlinear terms, for which a tight linear programming relaxation is derived by using an outer-approximation technique. The linear programming relaxation is then embedded within a global optimization solution algorithm based on range reduction technique, and the proposed approach is proved to converge to a global optimum.
-
global optimum of the linearized network Design Problem with equilibrium flows
Transportation Research Part B-methodological, 2010Co-Authors: David Z W Wang, Hong Kam LoAbstract:The road network Design Problem, typically formulated as a bi-level program or a mathematical program with equilibrium constraints, is generally non-convex. The non-convexity stems from both the traffic assignment equilibrium conditions and the non-linear travel time function. In this study, we formulate the network Design Problem as a single-level optimization Problem with equilibrium constraints, and then we transform the equilibrium constraints into a set of mixed-integer constraints and linearize the travel time function. The final result is that we cast the network Design Problem with equilibrium flows into a mixed-integer linear program, whose solution possesses the desirable property of global optimality, subject to the resolution of the linearization scheme adopted.
Bernard Fortz - One of the best experts on this subject based on the ideXlab platform.
-
On the hop-constrained survivable network Design Problem with reliable edges
Computers and Operations Research, 2015Co-Authors: Quentin Q. B. Botton, Bernard Fortz, Luis GouveiaAbstract:In this paper, we study the hop-constrained survivable network Design Problem with reliable edges. Given a graph with non-negative edge costs and node pairs Q, the hop-constrained survivable network Design Problem consists of constructing a minimum cost set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. In addition, we consider here a subset of reliable edges that are not subject to failure. We study two variants: a static Problem where the reliability of edges is given, and an upgrading Problem where edges can be upgraded to the reliable status at a given cost. We adapt for the two variants an extended formulation proposed in Botton, Fortz, Gouveia, Poss (2011) [1] for the case without reliable edges. As before, we use Benders decomposition to accelerate the solving process. Our computational results indicate that these two variants appear to be more difficult to solve than the original Problem (without reliable edges). We conclude with an economical analysis which evaluates the incentive of using reliable edges in the network.
-
On the hazmat transport network Design Problem
Lecture Notes in Computer Science, 2011Co-Authors: Edoardo Amaldi, Maurizio Bruglieri, Bernard FortzAbstract:We consider the Problem of Designing a network for hazardous material transportation where the government can decide which roads have to be forbidden to hazmats and the carriers choose the routes on the network. We assume that the government is interested in minimizing the overall risk of the shipments whereas the carriers minimize the route costs. In spite of the rich literature on hazmat transportation and of the relevance of this network Design Problem, it has received little attention and only quite recently. In this work we prove that the version of the hazmat transport network Design Problem where a subset of arcs can be forbidden is NP-hard even when a single commodity has to be shipped. We propose a bilevel integer programming formulation that guarantees solution stability and we derive a (single-level) mixed integer linear programming formulation that can be solved in reasonable time with a state-of-the-art solver. © 2011 Springer-Verlag.
David Pisinger - One of the best experts on this subject based on the ideXlab platform.
-
A matheuristic for the liner shipping network Design Problem
Transportation Research Part E: Logistics and Transportation Review, 2014Co-Authors: Berit Dangaard Brouer, Guy Desaulniers, David PisingerAbstract:We present an integer programming based heuristic, a matheuristic, for the liner shipping network Design Problem. This Problem consists of finding a set of container shipping routes defining a capacitated network for cargo transport. The objective is to maximize the revenue of cargo transport, while minimizing the cost of operating the network. Liner shipping companies publish a set of routes with a time schedule, and it is an industry standard to have a weekly departure at each port call on a route. A weekly frequency is achieved by deploying several vessels to a single route, respecting the available fleet of container vessels. The matheuristic is composed of four main algorithmic components: a construction heuristic, an improvement heuristic, a reinsertion heuristic, and a perturbation heuristic. The improvement heuristic uses an integer program to select a set of improving port insertions and removals on each service. Computational results are reported for the benchmark suite LINER-LIB 2012 following the industry standard of weekly departures on every schedule. The heuristic shows overall good performance and is able to find high quality solutions within competitive execution times. The matheuristic can also be applied as a decision support tool to improve an existing network by optimizing on a Designated subset of the routes. A case study is presented for this approach with very promising results.
-
a branch and cut algorithm for the container shipping network Design Problem
Flexible Services and Manufacturing Journal, 2012Co-Authors: Line Blander Reinhardt, David PisingerAbstract:The network Design Problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network Design and fleet assignment Problems are combined into a mixed integer linear programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependent capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the Problem considers transhipment cost. The Problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports.
