A multi-trip, multi-depot vehicle routing problem with vehicle time windows constraints.
The Vehicle Routing Problem (VRP) consists of the routing of capacitated vehicles over a network of customers with specific demands, beginning and ending at a central depot. The objective is to design a set of vehicle routes minimizing travel cost incurred in servicing the customers. Existing models...
Saved in:
Main Authors: | Naranjo, Michael Don R., Quintos, Joaquin Bernabe M., Tolosa, Camille Marie |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2000
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/10414 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
A multi-agent algorithm for vehicle routing problem with time window
by: Leong, H.W., et al.
Published: (2013) -
Multi-type attention for solving multi-depot vehicle routing problems
by: LI, Jinqi, et al.
Published: (2024) -
Hybrid genetic algorithms in solving vehicle routing problems with time window constraints
by: Tan, K.C., et al.
Published: (2014) -
Hybrid genetic algorithms in solving vehicle routing problems with time window constraints
by: Tan, K.C., et al.
Published: (2014) -
Vehicle routing problem with time windows and a limited number of vehicles
by: Lau, H.C., et al.
Published: (2013)