Search in:

Advanced search

Journal of the Operational Research Society Volume 63, 2012 - Issue 5

Submit an article Journal homepage

129

Views

CrossRef citations to date

Altmetric

General Paper

Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates

J PachecoUniversidad de BurgosBurgosSpainCorrespondence[email protected]

A AlvarezCiudad UniversitariaMonterreyNuevo LeónMexico

I GarcíaCiudad UniversitariaMonterreyNuevo LeónMexico;Universidad Autónoma de CoahuilaSaltilloMexico

F Angel-BelloInstituto Tecnológico de MonterreyMonterreyMexico

Pages 569-581 | Received 01 Mar 2010, Accepted 01 Mar 2011, Published online: 21 Dec 2017

Cite this article
https://doi.org/10.1057/jors.2011.51

Full Article
Figures & data
References
Citations
Metrics
Reprints & Permissions

References

AhujaRMagnantiTOrlinJNetwork Flows: Theory, Algorithms and Applications1993
Google Scholar
AlegreJLagunaMPachecoJOptimizing the periodic pick-up of raw materials for a manufacturer of auto partsEur J Opl Res200717973674610.1016/j.ejor.2005.03.063
Web of Science ®Google Scholar
BeasleyJRoute-first cluster-second methods for vehicle routingOmega19831140340810.1016/0305-0483(83)90033-6
Web of Science ®Google Scholar
BentleyJFast algorithms for geometric traveling salesman problemsORSA J Comput1992438741110.1287/ijoc.4.4.387
Google Scholar
BolducMRenaudJBoctorFLaporteGA perturbation metaheuristic for the vehicle routing problem with private fleet and common carriersJ Opns Res Soc200859677678710.1057/palgrave.jors.2602390
Web of Science ®Google Scholar
BrandãoJA deterministic tabu search algorithm for the fleet size and mix vehicle routing problemEur J Opl Res2009195371672810.1016/j.ejor.2007.05.059
Web of Science ®Google Scholar
BräysyOA reactive variable neighborhood search algorithm for the vehicle routing problem with time windowsINFORMS J Comput200315434736810.1287/ijoc.15.4.347.24896
Web of Science ®Google Scholar
BräysyOGendreauMVehicle routing problem with time windows, part I: Route construction and local search algorithmsTransport Sci200539110411810.1287/trsc.1030.0056
Web of Science ®Google Scholar
ChristofidesNBeasleyJThe period routing problemNetworks19841423725610.1002/net.3230140205
Web of Science ®Google Scholar
ClarkeGWrightJScheduling of vehicles from a central depot to a number of delivery pointsOpns Res196412456858110.1287/opre.12.4.568
Web of Science ®Google Scholar
CordeauJGendreauMLaporteGA tabu search heuristic for periodic and multidepot vehicle routing problemsNetworks19973010511910.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G
Web of Science ®Google Scholar
CordeauJLaporteGMercierAA unified tabu search heuristic for vehicle routing problems with time windowsJ Opl Res Soc20015292893610.1057/palgrave.jors.2601163
Web of Science ®Google Scholar
CordeauJLaporteGSavelsberghPVigoDVehicle routingTransportation, Handbooks in Operations Research and Management Science2007367428
Google Scholar
DijkstraEA note on two problems in connexion with graphsNumer Math1959126927110.1007/BF01386390
Web of Science ®Google Scholar
DullaertWJanssensGSorensenKVernimmenBNew heuristics for the fleet size and mix vehicle routing problem with time windowsJ Opl Res Soc2002531232123810.1057/palgrave.jors.2601422
Web of Science ®Google Scholar
FeoTResendeMA probabilistic heuristic for a computationally difficult set covering problemOpns Res Lett19898677110.1016/0167-6377(89)90002-3
Web of Science ®Google Scholar
FeoTResendeMGreedy randomized adaptive search proceduresJ Global Optim1995610913310.1007/BF01096763
Web of Science ®Google Scholar
FisherMOptimal solution of vehicle routing problems using minimum K-treesOpns Res19944262664210.1287/opre.42.4.626
Web of Science ®Google Scholar
FisherMJaikumarRA generalized assignment heuristic for vehicle routingNetworks19811110912410.1002/net.3230110205
Web of Science ®Google Scholar
FlisbergPBertil LidenBRonnqvistMA hybrid method based on linear programming and tabu search for routing of logging trucksComput Opns Res2009361122114410.1016/j.cor.2007.12.012
Web of Science ®Google Scholar
FrancisPSmilowitzKTzurMThe period vehicle routing problem and its extensionsThe Vehicle Routing Problem Latest Advances and New Challenges200873102
Google Scholar
GajpalYAbadPSaving-based algorithms for vehicle routing problem with simultaneous pickup and deliveryJ Opl Res Soc2010611498150910.1057/jors.2009.83
Web of Science ®Google Scholar
GambardellaLTaillardEAgazziGMACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windowsNew Ideas in Optimization1999
Google Scholar
GendreauMHertzALaporteGNew insertion and postoptimization procedures for the traveling salesman problemOpns Res1992401086109410.1287/opre.40.6.1086
Web of Science ®Google Scholar
GendreauMHertzALaporteGA tabu search heuristic for the vehicle routing problemMngt Sci1994401276129010.1287/mnsc.40.10.1276
Web of Science ®Google Scholar
GilletBMillerLA heuristic algorithm for the vehicle-dispatch problemOpns Res19742234034910.1287/opre.22.2.340
Web of Science ®Google Scholar
GloverFLagunaMMartíRFundamentals of scatter search and path relinkingControl Cybern200039653684
Google Scholar
GoelAGruhnVA general vehicle routing problemEur J Opl Res2008191365066010.1016/j.ejor.2006.12.065
Web of Science ®Google Scholar
HaghaniAJungSA dynamic vehicle routing problem with time-dependent travel timesComput Opns Res200532112959298610.1016/j.cor.2004.04.013
Web of Science ®Google Scholar
HemmelmayrVCDoernerKFHartlRFA variable neighbourhood search heuristic for periodic routing problemsEur J Opl Res200919579180210.1016/j.ejor.2007.08.048
Web of Science ®Google Scholar
ImramASaid SalhiSWassanNA variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problemEur J Opl Res2009197250951810.1016/j.ejor.2008.07.022
Web of Science ®Google Scholar
JozefowiezNGloverFLagunaMMulti-objective meta-heuristics for the traveling salesman problem with profitsJ Math Model Algor2008717719510.1007/s10852-008-9080-2
Google Scholar
KontoravdisGBardJA GRASP for the vehicle routing problem with time windowsORSA J Comput19957102310.1287/ijoc.7.1.10
Google Scholar
LiFYGoldenBWasilEThe open vehicle routing problem: Algorithms, large-scale test problems, and computational resultsComput Opns Res200734102918293010.1016/j.cor.2005.11.018
Web of Science ®Google Scholar
MarinakisYMigdalasAPardalosPA new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithmJ Global Optim200738455558010.1007/s10898-006-9094-0
Web of Science ®Google Scholar
MartelloSTothPKnapsack Problems Algorithms and Computer Implementations1990
Google Scholar
MesterDBräysyOActive guided evolution strategies for large-scale vehicle routing problems with time windowsComput Opns Res20053261593161410.1016/j.cor.2003.11.017
Web of Science ®Google Scholar
Or I (1976). Traveling Salesman Type Combinatorial Problems and Their Relations to the Logistics of Blood Banking. Dissertation, Northwestern University.
Google Scholar
OsmanIMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnn Opl Res19934142145110.1007/BF02023004
Google Scholar
PisingerDRopkeSA general heuristic for vehicle routing problemsComput Opns Res20073482403243510.1016/j.cor.2005.09.012
Web of Science ®Google Scholar
PitsoulisLResendeMGreedy randomized adaptive search proceduresHandbook of Applied Optimization2002168183
Google Scholar
Potvin J and Bengio S (1994). A genetic approach to the vehicle routing problem with time windows. Technical Report CRT-953, Centre de Recherche sur les Transports, Université de Montréal.
Google Scholar
PotvinJNaudMTabu search with ejection chains for the vehicle routing problem with private fleet and common carrierJ Opl Res Soc201162232633610.1057/jors.2010.102
Web of Science ®Google Scholar
PrinsCA simple and effective evolutionary algorithm for the vehicle routing problemComput Opns Res2004311985200210.1016/S0305-0548(03)00158-8
Web of Science ®Google Scholar
PrinsCProdhonCSolving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristicTransport Sci20074147048310.1287/trsc.1060.0187
Web of Science ®Google Scholar
RochatYTaillardEProbabilistic diversification and intensification in local search for vehicle routingJ Heuristic19954014716710.1007/BF02430370
Google Scholar
RopkeSPisingerDA unified heuristic for a large class of vehicle routing problems with backhaulsEur J Opl Res2006171375077510.1016/j.ejor.2004.09.004
Web of Science ®Google Scholar
Simchi-LeviDChenXBramelJThe Logic of Logistics. Theory, Algorithms and Applications for Logistics and Supply Chain Management2005
Google Scholar
TaillardEBadeauPGendreauMPotvinJA tabu search heuristic for the vehicle routing problem with soft time windowsTransport Sci19973117018610.1287/trsc.31.2.170
Web of Science ®Google Scholar
TanKCChewYHLeeLHA hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problemsEur J Opl Res2006172385588510.1016/j.ejor.2004.11.019
Web of Science ®Google Scholar
TarantilisCKiranoudisCA flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sectorEur J Opl Res2007179380682210.1016/j.ejor.2005.03.059
Web of Science ®Google Scholar
Thangiah S, Osman I and Sun T (1994). Hybrid genetic algorithm simulated annealing and tabu search methods for vehicle routing problem with time windows. Technical Report 27, Computer Science Department, Slippery Rock University.
Google Scholar
TothPVigoDMonographs on discrete mathematics and applicationsVehicle Routing Probl2002
Google Scholar
VondourisCTsangEGuided local search and its application to the travelling salesman problemEur J Opns Res199911346949910.1016/S0377-2217(98)00099-X
Web of Science ®Google Scholar
ZachariadisETarantilisCKiranoudisCA guided tabu search for the vehicle routing problem with two-dimensional loading constraintsEur J Opl Res2009195372974310.1016/j.ejor.2007.05.058
Web of Science ®Google Scholar
ZachariadisETarantilisCKiranoudisCA hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up serviceExpert Syst Appl20093621070108110.1016/j.eswa.2007.11.005
Web of Science ®Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.

People also read
Recommended articles
Cited by

To cite this article:

Reference style: APA Chicago Harvard

Citation copied to clipboard

Reference styles above use APA (6th edition), Chicago (16th edition) & Harvard (10th edition)

Download citation

Download a citation file in RIS format that can be imported by citation management software including EndNote, ProCite, RefWorks and Reference Manager.

Choose format: RIS BibTex RefWorks Direct Export

Choose options: Citation Citation & abstract Citation & references

Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date