Vis enkel innførsel

dc.contributor.authorBredström, David
dc.contributor.authorRönnqvist, Mikael
dc.date.accessioned2007-06-21T12:50:48Z
dc.date.available2007-06-21T12:50:48Z
dc.date.issued2006
dc.identifier.issn1500-4066
dc.identifier.urihttp://hdl.handle.net/11250/163873
dc.description.abstractWe present a mathematical programming model for the combined vehicle routing and scheduling problem with time windows and additional temporal constraints. The temporal constraints allow for imposing pairwise synchronization and pairwise temporal precedence between customer visits, independently of the vehicles. We describe some real world problems where the temporal constraints, in the literature, usually are remarkably simplified in the solution process, even though these constraints may significantly improve the solution quality and/or usability. We also propose an optimization based heuristic to solve real size instances. The results of numerical experiments substantiate the importance of the temporal constraints in the solution approach. We also make a computational study by comparing a direct usage of a commercial solver against the proposed heuristic where the latter approach can find high quality solutions within distinct time limits.en
dc.language.isoengen
dc.publisherNorwegian School of Economics and Business Administration. Department of Finance and Management Scienceen
dc.relation.ispartofseriesDiscussion paperen
dc.relation.ispartofseries2006:18en
dc.subjectroutingen
dc.subjectschedulingen
dc.subjecttemporal constraintsen
dc.subjectsynchronizationen
dc.subjectbranch and bounden
dc.titleCombined vehicle routing and scheduling with temporal precedence and synchronization constraintsen
dc.typeWorking paperen
dc.subject.nsiVDP::Matematikk og Naturvitenskap: 400::Matematikk: 410en


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel