A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint
From MaRDI portal
Publication:2150477
DOI10.1007/s12597-020-00481-6OpenAlexW3127165636MaRDI QIDQ2150477
Arjun Paul, Ravi Shankar Kumar, Chayanika Rout, Adrijit Goswami
Publication date: 27 June 2022
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-020-00481-6
Cites Work
- A matheuristic approach for the pollution-routing problem
- Fuel emissions optimization in vehicle routing problems with time-varying speeds
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- A large neighbourhood based heuristic for two-echelon routing problems
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- The two-echelon multi-depot inventory-routing problem
- The electric two-echelon vehicle routing problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- A two-echelon inventory routing problem for perishable products
- A multi-objective variable neighborhood search algorithm for solving the hybrid flow shop problem
- A column generation approach for location-routing problems with pickup and delivery
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- Ant colony system for a VRP with multiple time windows and multiple visits
- An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem
