Exact hybrid algorithms for solving a bi-objective vehicle routing problem

DOI10.1007/S10100-010-0158-3zbMath1245.90010OpenAlexW1966252361MaRDI QIDQ441036

Walter J. Gutjahr, Peter Reiter

Publication date: 20 August 2012

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-010-0158-3

zbMATH Keywords

branch-and-cutdistance constraintsmultiobjective combinatorial optimizationcapacitated vehicle routing problem\texttt{TSPLIB}

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (7)

The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ A hybrid metaheuristic for smart waste collection problems with workload concerns ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices ⋮ Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction ⋮ Multi-objective branch and bound ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years

Uses Software

• VRP
• CVRPSEP
• CVRPSP
• weightedHypervolume

Cites Work

• Unnamed Item
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A new subtour elimination constraint for the vehicle routing problem
• Estimating the Held-Karp lower bound for the geometric TSP
• Separating capacity constraints in the CVRP using tabu search
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Multi-objective vehicle routing problems
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A scatter search for the periodic capacitated arc routing problem
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Two exact algorithms for the distance-constrained vehicle routing problem
• An exact algorithm for the asymmetrical capacitated vehicle routing problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Exact hybrid algorithms for solving a bi-objective vehicle routing problem