AUB ScholarWorks

A variable neighbourhood search algorithm for the open vehicle routing problem

Show simple item record

dc.contributor.author Fleszar K.
dc.contributor.author Osman I.H.
dc.contributor.author Hindi K.S.
dc.contributor.editor
dc.date 2009
dc.date.accessioned 2017-09-07T07:51:44Z
dc.date.available 2017-09-07T07:51:44Z
dc.date.issued 2009
dc.identifier 10.1016/j.ejor.2007.06.064
dc.identifier.isbn
dc.identifier.issn 03772217
dc.identifier.uri http://hdl.handle.net/10938/12321
dc.description.abstract In the open vehicle routing problem (OVRP), the objective is to minimise the number of vehicles and then minimise the total distance (or time) travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced by each vehicle must not exceed vehicle capacity. Additionally, in one variant of the problem, the travel time of each vehicle should not exceed an upper limit. An effective variable neighbourhood search (VNS) heuristic for this problem is proposed. The neighbourhoods are based on reversing segments of routes (sub-routes) and exchanging segments between routes. Computational results on sixteen standard benchmark problem instances show that the proposed VNS is comparable in terms of solution quality to the best performing published heuristics. © 2007 Elsevier B.V. All rights reserved.
dc.format.extent
dc.format.extent Pages: (803-809)
dc.language English
dc.publisher AMSTERDAM
dc.relation.ispartof Publication Name: European Journal of Operational Research; Publication Year: 2009; Volume: 195; no. 3; Pages: (803-809);
dc.relation.ispartofseries
dc.relation.uri
dc.source Scopus
dc.subject.other
dc.title A variable neighbourhood search algorithm for the open vehicle routing problem
dc.type Article
dc.contributor.affiliation Fleszar, K., School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon
dc.contributor.affiliation Osman, I.H., School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon
dc.contributor.affiliation Hindi, K.S., Faculty of Engineering and Architecture, School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon
dc.contributor.authorAddress Fleszar, K.; School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon; email: kf09@aub.edu.lb
dc.contributor.authorCorporate University: American University of Beirut; Faculty: Suliman S. Olayan School of Business; Department: School of Business;
dc.contributor.authorDepartment School of Business
dc.contributor.authorDivision
dc.contributor.authorEmail kf09@crub.edu.lb
dc.contributor.faculty Suliman S. Olayan School of Business
dc.contributor.authorInitials Fleszar, K
dc.contributor.authorInitials Osman, IH
dc.contributor.authorInitials Hindi, KS
dc.contributor.authorOrcidID Fleszar, Krzysztof-0000-0001-8863-6756
dc.contributor.authorReprintAddress Fleszar, K (reprint author), Amer Univ Beirut, Sch Business, POB 11-0236 Riad El Solh, Beirut 11072020, Lebanon.
dc.contributor.authorResearcherID Fleszar, Krzysztof-B-8260-2012
dc.contributor.authorUniversity American University of Beirut
dc.description.cited Brandao J, 2004, EUR J OPER RES, V157, P552, DOI 10.1016-S0377-2217(03)00238-8; Braysy O, 2003, INFORMS J COMPUT, V15, P347, DOI 10.1287-ijoc.15.4.347.24896; Christofides N., 1979, COMBINATORIAL OPTIMI, P313; Crispim J, 2005, J OPER RES SOC, V56, P1296, DOI 10.1057-palgrave.jors.2601935; DONGARRA J, 2006, PERFORMANCE VARIOUS; FISHER ML, 1994, OPER RES, V42, P626, DOI 10.1287-opre.42.4.626; Fleszar K, 2002, COMPUT OPER RES, V29, P821, DOI 10.1016-S0305-0548(00)00082-4; Fleszar K, 2008, EUR J OPER RES, V191, P612, DOI 10.1016-j.ejor.2006.12.055; Fu Z, 2006, J OPER RES SOC, V57, P1018, DOI 10.1057-palgrave.jors.2602181; Fu Z, 2005, J OPER RES SOC, V56, P267, DOI 10.1057-palgrave.jors.2601817; GENDREAU M, 1994, MANAGE SCI, V40, P1276, DOI 10.1287-mnsc.40.10.1276; GENDREAU M, 1992, OPER RES, V40, P1086, DOI 10.1287-opre.40.6.1086; Kolisch R, 1996, NAV RES LOG, V43, P23, DOI 10.1002-(SICI)1520-6750(199602)43:123::AID-NAV23.0.CO;2-P; Kytojoki J, 2007, COMPUT OPER RES, V34, P2743, DOI 10.1016-j.cor.2005.10.010; Li FY, 2007, COMPUT OPER RES, V34, P2918, DOI 10.1016-j.cor.2005.11.018; Mladenovic N, 1997, COMPUT OPER RES, V24, P1097, DOI 10.1016-S0305-0548(97)00031-2; Pisinger D, 2007, COMPUT OPER RES, V34, P2403, DOI 10.1016-j.cor.2005.09.012; Polacek M, 2004, J HEURISTICS, V10, P613, DOI 10.1007-s10732-005-5432-5; Sariklis D, 2000, J OPER RES SOC, V51, P564; SCHRAGE L, 1981, NETWORKS, V11, P229, DOI 10.1002-net.3230110212; Syslo M. M., 1983, DISCRETE OPTIMIZATIO; Tarantilis CD, 2005, J OPER RES SOC, V56, P588, DOI 10.1057-palgrave.jors.2601848
dc.description.citedCount 55
dc.description.citedTotWOSCount 45
dc.description.citedWOSCount 44
dc.format.extentCount 7
dc.identifier.articleNo
dc.identifier.coden EJORD
dc.identifier.pubmedID
dc.identifier.scopusID 56349100703
dc.identifier.url
dc.publisher.address PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
dc.relation.ispartofConference
dc.relation.ispartofConferenceCode
dc.relation.ispartofConferenceDate
dc.relation.ispartofConferenceHosting London Sch Econ
dc.relation.ispartofConferenceLoc
dc.relation.ispartofConferenceSponsor
dc.relation.ispartofConferenceTitle
dc.relation.ispartofFundingAgency
dc.relation.ispartOfISOAbbr Eur. J. Oper. Res.
dc.relation.ispartOfIssue 3
dc.relation.ispartOfPart
dc.relation.ispartofPubTitle European Journal of Operational Research
dc.relation.ispartofPubTitleAbbr Eur J Oper Res
dc.relation.ispartOfSpecialIssue
dc.relation.ispartOfSuppl
dc.relation.ispartOfVolume 195
dc.source.ID WOS:000261941400015
dc.type.publication Journal
dc.subject.otherAuthKeyword Metaheuristics
dc.subject.otherAuthKeyword Variable neighbourhood search
dc.subject.otherAuthKeyword Vehicle routing
dc.subject.otherChemCAS
dc.subject.otherIndex Benchmarking
dc.subject.otherIndex Customer satisfaction
dc.subject.otherIndex Heuristic methods
dc.subject.otherIndex Learning algorithms
dc.subject.otherIndex Network routing
dc.subject.otherIndex Routing algorithms
dc.subject.otherIndex Sales
dc.subject.otherIndex Vehicles
dc.subject.otherIndex Computational results
dc.subject.otherIndex En routes
dc.subject.otherIndex Metaheuristics
dc.subject.otherIndex Number of vehicles
dc.subject.otherIndex Open vehicle routing problems
dc.subject.otherIndex Solution qualities
dc.subject.otherIndex Standard benchmarks
dc.subject.otherIndex Travel times
dc.subject.otherIndex Upper limits
dc.subject.otherIndex Variable neighbourhood search
dc.subject.otherIndex Variable neighbourhood searches
dc.subject.otherIndex Vehicle capacities
dc.subject.otherIndex Vehicle routing
dc.subject.otherKeywordPlus SCHEDULING PROBLEMS
dc.subject.otherKeywordPlus TIME WINDOWS
dc.subject.otherWOS Management
dc.subject.otherWOS Operations Research and Management Science
dc.identifier.doi https://doi.org/10.1016/j.ejor.2007.06.064


Files in this item

Thumbnail
Name: 2009-EJOR-OVRP.pdf
Size: 192.3Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


Browse

My Account