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

Christian Edinger Munk Plum, David Pisinger, Juan-José Salazar-González, Mikkel M. Sigurd

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    302 Downloads (Pure)

    Abstract

    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
    Publication statusPublished - 2012
    EventInternational MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012) - Hong Kong, Hong Kong
    Duration: 14 Mar 201216 Mar 2012

    Conference

    ConferenceInternational MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012)
    Country/TerritoryHong Kong
    CityHong Kong
    Period14/03/201216/03/2012
    SeriesLecture Notes in Engineering and Computer Science
    ISSN2078-0958

    Keywords

    • IMECS

    Fingerprint

    Dive into the research topics of 'The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits'. Together they form a unique fingerprint.

    Cite this