Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization
From MaRDI portal
Publication:5429298
DOI10.1007/978-3-540-74446-7_15zbMath1134.90313WikidataQ59390013 ScholiaQ59390013MaRDI QIDQ5429298
Joseph M. Pasia, Marc Reimann, Karl F. Doerner, 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
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
The bi-objective mixed capacitated general routing problem with different route balance criteria, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, An algorithm for the capacitated vehicle routing problem with route balancing, Workload equity in vehicle routing: the impact of alternative workload resources