Solving elementary shortest-path problems as mixed-integer programs
Michael Drexl,Stefan Irnich +1 more
TL;DR: This paper assesses the quality of the lower bounds provided by an integer relaxation of the multi-commodity flow formulation of the ESPP and shows that a formulation based on multi- commodity flows possesses a significantly stronger LP relaxation than a formulations based on arc flow variables.
read more
Abstract: Ibrahim et al. (Int Trans Oper Res 16:361---369, 2009) presented and analyzed two integer programming formulations for the elementary shortest-path problem (ESPP), which is known to be NP-hard if the underlying digraph contains negative cycles. In fact, the authors showed that a formulation based on multi-commodity flows possesses a significantly stronger LP relaxation than a formulation based on arc flow variables. Since the ESPP is essentially an integer problem, the contribution of our paper lies in extending this research by comparing the formulations with regard to the computation time and memory requirements required for their integer solution. Moreover, we assess the quality of the lower bounds provided by an integer relaxation of the multi-commodity flow formulation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Vehicle routing problems with profits
Claudia Archetti,Maria Grazia Speranza,Daniele Vigo +2 more
- 01 Jan 2014
92
Generalized Periodic Vehicle Routing and Maritime Surveillance
TL;DR: This paper presents a meta-analysis of maritime surveillance resources in military operations and long-term defense planning that shows clear trends in demand and in the amount of resources available for surveillance activities are decreasing.
Exact methods for solving the elementary shortest and longest path problems
TL;DR: This paper considers the problems of finding the elementary shortest and longest paths on a graph containing negative and positive cycles and proposes exact algorithms based on mixed integer programming for their solution, employing different valid inequalities.
11
Fitness switching genetic algorithm for solving combinatorial optimization problems with rare feasible solutions
Jun Woo Kim,Soo-Kyun Kim +1 more
TL;DR: The fitness switching and fitness leveling operations for maintaining the population of both feasible and infeasible paths during the search procedure are introduced and the proposed algorithm can address the issues in the combinatorial optimization problems with rare feasible solutions very effectively.
11
References
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
- 01 Jan 2001
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
4.2K
The traveling salesman problem and its variations
Gregory Gutin,Abraham P. Punnen +1 more
- 01 Jan 2007
TL;DR: This paper presents Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP, a model for solving the Asymmetric Traveling Salesman Problem, and some examples of how this model was applied to the Geometric TSP.
The vehicle routing problem : latest advances and new challenges
Bruce L. Golden,S. Raghavan,Edward Wasil +2 more
- 01 Jan 2008
TL;DR: In this article, the authors present a survey of the state-of-the-art approaches for solving the Capacitated Vehicle Routing Problem on trees and using a genetic algorithm to solve the generalized orienteering problem.
1.4K
Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
TL;DR: In this article, the authors formulated the vehicle routing problem of simultaneous deliveries and pickups with split loads and time windows (VRPSDPSLTW) as a mixed-integer programming problem and developed a hybrid heuristic algorithm to solve this problem.
1.1K
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.
1.1K