The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

Documents

View graph of relations

The design of container shipping networks is an important real world problem, with assets and operational costs in billions of dollars. To guide the optimal deployment of the ships, a single vessel roundtrip is considered by minimizing operational costs and flowing the best paying cargo under commercial constraints. Inspiration for formulation and solution method is taken from the rich research done within pickup and delivery problems. The problem, the multicommodity one-toone pickup and delivery traveling salesman problem with path duration limits is, to the best of out knowledge, considered for the first time. An arc flow and a path flow model are presented. A Branch and Cut and Price solution method is proposed and implemented.
Original languageEnglish
Title of host publicationProceedings of the International MultiConference of Engineers and Computer Scientists 2012
Volume2
Publication date2012
Pages1578-1581
StatePublished

Conference

ConferenceInternational MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012)
CountryHong Kong
CityHong Kong
Period14/03/1216/03/12
NameLecture Notes in Engineering and Computer Science
ISSN (Print)2078-0958

Keywords

  • IMECS
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 10784764