The bi-objective mixed capacitated general routing problem with different route balance criteria

DOI10.1016/j.ejor.2015.11.024zbMath1346.90118OpenAlexW2187028603MaRDI QIDQ322701

Elin E. Halvorsen-Weare, Savelsbergh, Martin W. P.

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11250/2458816

zbMATH Keywords

vehicle routingbox methodbi-objective optimizationmixed capacitated general routing problemroute balance

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items

Planning sustainable routes: economic, environmental and welfare concerns, 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, Multi-objective sustainable capacitated location routing problem formulation in sustainable supply-chain management, Arc routing problems: A review of the past, present, and future, Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Workload equity in vehicle routing: the impact of alternative workload resources, A lexicographic minimax approach to the vehicle routing problem with route balancing, Ant Lion Optimized Lexicographic Model for Shortest Path Identification

Uses Software

• CBMix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for the node, edge, and arc routing problem
• Modeling and solving the mixed capacitated general routing problem
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem
• An algorithm for the capacitated vehicle routing problem with route balancing
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Recent advances in memetic algorithms.
• A capacitated general routing problem on mixed networks
• Routing problems: A bibliography
• The bi-objective pollution-routing problem
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms
• An evolutionary algorithm for the vehicle routing problem with route balancing
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. International workshop, SLS 2007, Brussels, Belgium, September 6--8, 2007. Proceedings.
• Finding representative systems for discrete bicriterion optimization problems
• Multi-objective vehicle routing problems
• A genetic algorithm for a bi-objective capacitated arc routing problem
• Waste collection vehicle routing problem with time windows
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• The mixed capacitated general routing problem under uncertainty
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
• The balanced billing cycle vehicle routing problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods
• Multicriteria Optimization
• Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
• Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization