A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands

DOI10.1007/S10479-017-2500-9zbMath1434.90011OpenAlexW2607618241MaRDI QIDQ1730662

H. Manier, Zaher Al Chami, Marie-Ange Manier

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2500-9

zbMATH Keywords

transportationrouting problemsexact algorithmscity logistics

Mathematics Subject Classification ID

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

Related Items (5)

Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ The rendezvous vehicle routing problem ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems ⋮ A multi-objective humanitarian pickup and delivery vehicle routing problem with drones ⋮ Ant Lion Optimized Lexicographic Model for Shortest Path Identification

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot
• The vehicle routing problem. Latest advances and new challenges.
• Multi-trip pickup and delivery problem with time windows and synchronization
• Routing problems: A bibliography
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• The dial-a-ride problem: Models and algorithms
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• The General Pickup and Delivery Problem

This page was built for publication: A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands