Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
From MaRDI portal
Publication:2005939
DOI10.1007/s11067-019-09492-3OpenAlexW3002568473WikidataQ126289895 ScholiaQ126289895MaRDI QIDQ2005939
Puntipa Punyim, Wanvara Nueangnitnaraporn, Ampol Karoonsoontawong, Vatanavongs Ratanavaraha
Publication date: 8 October 2020
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-019-09492-3
Uses Software
Cites Work
- Unnamed Item
- Rich vehicle routing problems: from a taxonomy to a definition
- Large neighborhood search for multi-trip vehicle routing
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A GA based heuristic for the vehicle routing problem with multiple trips
- The multi-shift vehicle routing problem with overtime
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Vehicle dispatching with time-dependent travel times
- Designing and reporting on computational experiments with heuristic methods
- Record breaking optimization results using the ruin and recreate principle
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Vehicle Routeing with Multiple Use of Vehicles
- Vehicle routing problems with multiple trips
This page was built for publication: Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
