Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization

DOI10.1007/978-3-540-74446-7_15MaRDI QIDQ5429298zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Joseph M. Pasia, K. F. Doerner, Marc Reimann, Richard F. Hartl

Publication date 29 November 2007

Published in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74446-7_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An evolutionary algorithm for the vehicle routing problem with route balancing
• An improved ant colony algorithm for multi-objective vehicle routing problem with simultaneous pickup and delivery
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem
• An algorithm for the capacitated vehicle routing problem with route balancing
• Evolutionary Computation in Combinatorial Optimization

Cited in

(5)

• An algorithm for the capacitated vehicle routing problem with route balancing
• Workload equity in vehicle routing: the impact of alternative workload resources
• An evolutionary algorithm for the vehicle routing problem with route balancing
• The bi-objective mixed capacitated general routing problem with different route balance criteria
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem

This page was built for publication: Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429298)