dc.creatorOrtega,Pablo
dc.creatorOliva,Cristian
dc.creatorFerland,Jacques
dc.creatorCepeda,Manuel
dc.date2009-12-01
dc.date.accessioned2017-03-07T16:26:20Z
dc.date.available2017-03-07T16:26:20Z
dc.identifierhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052009000300013
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/401627
dc.descriptionThe 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.formattext/html
dc.languageen
dc.publisherUniversidad de Tarapacá.
dc.sourceIngeniare. Revista chilena de ingeniería v.17 n.3 2009
dc.subjectVehicle routing problem
dc.subjectant colony system
dc.subjectscheduling
dc.titleMULTIPLE ANT COLONY SYSTEM FOR A VRP WITH TIME WINDOWS AND SCHEDULED LOADING
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución