Multiobjective vehicle routing problem with fixed delivery and optional collections

DOI10.1007/S11590-012-0551-ZMaRDI QIDQ375980zbMATH OpenOpenAlexFDO

Authors Luciana P. Assis, André L. Maravilha, Alessandro Vivas, Felipe Campelo, J. A. Ramirez

Publication date 1 November 2013

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-012-0551-z

zbMATH Keywords

multiobjective optimizationvehicle routing problemiterated local searchselective pickups

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• The Vehicle Routing Problem with Backhauls: A Multi-objective Evolutionary Approach
• From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
• An improved ant colony algorithm for multi-objective vehicle routing problem with simultaneous pickup and delivery
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes

Cites work

• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 4108183 (Why is no real title available?)
• scientific article; zbMATH DE number 721857 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• An evolutionary algorithm for the vehicle routing problem with route balancing
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• Estimates of Location Based on Rank Tests
• Genetic local search for multi-objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Multi-objective memetic algorithms
• Multi-objective vehicle routing problems
• Multiple Comparisons Among Means
• Multi‐objective combinatorial optimization problems: A survey
• Some nonparametric tests and selection procedures for main effects in two-way layouts
• Tabu search for a multi-objective routing problem
• The single vehicle routing problem with deliveries and selective pickups
• The single‐vehicle routing problem with unrestricted backhauls

Cited in

(3)

• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads
• Bi-objective hypervolume-based Pareto optimization

This page was built for publication: Multiobjective vehicle routing problem with fixed delivery and optional collections

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