A method for solving vehicle routing and scheduling problems
Identifieur interne : 001F71 ( Crin/Corpus ); précédent : 001F70; suivant : 001F72A method for solving vehicle routing and scheduling problems
Auteurs : Eric Domenjoud ; Claude Kirchner ; Jianyang ZhouSource :
English descriptors
- KwdEn :
Abstract
In this research, we study a transportation problem which is concerned with vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers. Its solution involves planning itineraries for buses and establishing working schedule for drivers, subject to vehicle capacity limitation and time constraints. The objective is to optimally schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations, which provides a global planning over all routes. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests.
Links to Exploration step
CRIN:domenjoud97aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="259">A method for solving vehicle routing and scheduling problems</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:domenjoud97a</idno>
<date when="1997" year="1997">1997</date>
<idno type="wicri:Area/Crin/Corpus">001F71</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A method for solving vehicle routing and scheduling problems</title>
<author><name sortKey="Domenjoud, Eric" sort="Domenjoud, Eric" uniqKey="Domenjoud E" first="Eric" last="Domenjoud">Eric Domenjoud</name>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
</author>
<author><name sortKey="Zhou, Jianyang" sort="Zhou, Jianyang" uniqKey="Zhou J" first="Jianyang" last="Zhou">Jianyang Zhou</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>permutation</term>
<term>set partitioning</term>
<term>vehicle routing</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1905">In this research, we study a transportation problem which is concerned with vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers. Its solution involves planning itineraries for buses and establishing working schedule for drivers, subject to vehicle capacity limitation and time constraints. The objective is to optimally schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations, which provides a global planning over all routes. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests.</div>
</front>
</TEI>
<BibTex type="inproceedings"><ref>domenjoud97a</ref>
<crinnumber>97-R-280</crinnumber>
<category>5</category>
<equipe>PROTHEO</equipe>
<author><e>Domenjoud, Eric</e>
<e>Kirchner, Claude</e>
<e>Zhou, Jianyang</e>
</author>
<title>A method for solving vehicle routing and scheduling problems</title>
<booktitle>{ERCIM/COMPULOG Workshop on Constraints in conjunction with CP97, Schloss Hagenberg, Austria}</booktitle>
<year>1997</year>
<keywords><e>permutation</e>
<e>vehicle routing</e>
<e>set partitioning</e>
</keywords>
<abstract>In this research, we study a transportation problem which is concerned with vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers. Its solution involves planning itineraries for buses and establishing working schedule for drivers, subject to vehicle capacity limitation and time constraints. The objective is to optimally schedule the fleet of vehicles for customer demand so as to reduce costs. This paper presents a complete constraint model for solving the problem. For vehicle routing, a permutation constraint is used to impose a total order for visiting all customer locations, which provides a global planning over all routes. For driver scheduling, set partitioning constraints are used for assigning drivers and vehicles to requests.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F71 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 001F71 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Corpus |type= RBID |clé= CRIN:domenjoud97a |texte= A method for solving vehicle routing and scheduling problems }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |