A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

2 Citaties (Scopus)

Uittreksel

We study a transportation planning problem with multiple transportation modes, perishable products, and management of Reusable Transport Items (RTIs). This problem is inspired by the European horticultural chain. We present a Mixed Integer Programming (MIP) optimization model which is an extension of the Fixed-charge Capacitated Multicommodity Network Flow Problem (FCMNFP). The MIP integrates dynamic allocation, flow, and repositioning of the RTIs in order to find the trade-off between product freshness requirements, and operational circumstances and costs. We furthermore propose an Adaptive Large Neighborhood Search (ALNS) algorithm with new neighborhoods, and intensification and diversification strategies. We then provide detailed computational analysis on its properties, compare its results with a state-of-the-art MIP solver, and provide practical insights.

TaalEngels
Pagina's321-344
TijdschriftTransportation Research Part B: Methodological
Volume106
DOI's
StatusGepubliceerd - 2017

Vingerafdruk

Integer programming
programming
optimization model
diversification
Planning
planning
costs
management
Metaheuristics
Network flow
Mixed integer programming
Product quality
Costs

Trefwoorden

    Citeer dit

    @article{a4ed50827b1d42438a27ddab8f1e7d25,
    title = "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning",
    abstract = "We study a transportation planning problem with multiple transportation modes, perishable products, and management of Reusable Transport Items (RTIs). This problem is inspired by the European horticultural chain. We present a Mixed Integer Programming (MIP) optimization model which is an extension of the Fixed-charge Capacitated Multicommodity Network Flow Problem (FCMNFP). The MIP integrates dynamic allocation, flow, and repositioning of the RTIs in order to find the trade-off between product freshness requirements, and operational circumstances and costs. We furthermore propose an Adaptive Large Neighborhood Search (ALNS) algorithm with new neighborhoods, and intensification and diversification strategies. We then provide detailed computational analysis on its properties, compare its results with a state-of-the-art MIP solver, and provide practical insights.",
    keywords = "Adaptive Large Neighborhood Search (ANLS), Mixed Integer Programming (MIP), Multimodal transportation, Perishability, Reusable transport item",
    author = "M. SteadieSeifi and N.P. Dellaert and W. Nuijten and {van Woensel}, T.",
    year = "2017",
    doi = "10.1016/j.trb.2017.07.007",
    language = "English",
    volume = "106",
    pages = "321--344",
    journal = "Transportation Research. Part B: Methodological",
    issn = "0191-2615",
    publisher = "Elsevier",

    }

    TY - JOUR

    T1 - A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning

    AU - SteadieSeifi,M.

    AU - Dellaert,N.P.

    AU - Nuijten,W.

    AU - van Woensel,T.

    PY - 2017

    Y1 - 2017

    N2 - We study a transportation planning problem with multiple transportation modes, perishable products, and management of Reusable Transport Items (RTIs). This problem is inspired by the European horticultural chain. We present a Mixed Integer Programming (MIP) optimization model which is an extension of the Fixed-charge Capacitated Multicommodity Network Flow Problem (FCMNFP). The MIP integrates dynamic allocation, flow, and repositioning of the RTIs in order to find the trade-off between product freshness requirements, and operational circumstances and costs. We furthermore propose an Adaptive Large Neighborhood Search (ALNS) algorithm with new neighborhoods, and intensification and diversification strategies. We then provide detailed computational analysis on its properties, compare its results with a state-of-the-art MIP solver, and provide practical insights.

    AB - We study a transportation planning problem with multiple transportation modes, perishable products, and management of Reusable Transport Items (RTIs). This problem is inspired by the European horticultural chain. We present a Mixed Integer Programming (MIP) optimization model which is an extension of the Fixed-charge Capacitated Multicommodity Network Flow Problem (FCMNFP). The MIP integrates dynamic allocation, flow, and repositioning of the RTIs in order to find the trade-off between product freshness requirements, and operational circumstances and costs. We furthermore propose an Adaptive Large Neighborhood Search (ALNS) algorithm with new neighborhoods, and intensification and diversification strategies. We then provide detailed computational analysis on its properties, compare its results with a state-of-the-art MIP solver, and provide practical insights.

    KW - Adaptive Large Neighborhood Search (ANLS)

    KW - Mixed Integer Programming (MIP)

    KW - Multimodal transportation

    KW - Perishability

    KW - Reusable transport item

    UR - http://www.scopus.com/inward/record.url?scp=85026638732&partnerID=8YFLogxK

    U2 - 10.1016/j.trb.2017.07.007

    DO - 10.1016/j.trb.2017.07.007

    M3 - Article

    VL - 106

    SP - 321

    EP - 344

    JO - Transportation Research. Part B: Methodological

    T2 - Transportation Research. Part B: Methodological

    JF - Transportation Research. Part B: Methodological

    SN - 0191-2615

    ER -