dc.creator | Ortega,Pablo | |
dc.creator | Oliva,Cristian | |
dc.creator | Ferland,Jacques | |
dc.creator | Cepeda,Manuel | |
dc.date | 2009-12-01 | |
dc.date.accessioned | 2019-04-24T21:28:03Z | |
dc.date.available | 2019-04-24T21:28:03Z | |
dc.identifier | https://scielo.conicyt.cl/scielo.php?script=sci_arttext&pid=S0718-33052009000300013 | |
dc.identifier.uri | http://revistaschilenas.uchile.cl/handle/2250/58588 | |
dc.description | The vehicle routing problem with time windows and scheduled loading [VRPTWSL] requires not only the design of routes with time windows and capacity constraints, but also a schedule of the departures of vehicles from the depot given a load time due to the limited resources available to load the demand in the vehicles. A mathematical formulation of the vehicle routing problem with time windows and scheduled loading is presented and a metaheuristics based on Multiple Ant Colony System is proposed and implemented where two ant colonies, each with a single objective function, are organized in a hierarchical way. A time update procedure is incorporated into the ant constructive procedure to update and schedule the departure of a vehicle from the depot when each ant moves to a new customer-node. Constraint programming is used to determine a feasible move to a new customer-node. As [VRPTWSL] incorporates the vehicle departure scheduling, the algorithm presented in this paper has a direct application to real problems, in this way [VRPTWSL] can be taken as an important advance for practical vehicle routing problems. | |
dc.format | text/html | |
dc.language | en | |
dc.publisher | Universidad de Tarapacá. | |
dc.relation | 10.4067/S0718-33052009000300013 | |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.source | Ingeniare. Revista chilena de ingeniería v.17 n.3 2009 | |
dc.subject | Vehicle routing problem | |
dc.subject | ant colony system | |
dc.subject | scheduling | |
dc.title | MULTIPLE ANT COLONY SYSTEM FOR A VRP WITH TIME WINDOWS AND SCHEDULED LOADING | |