Variable fixing heuristics for the capacitated multicommodity network flow problem with multiple transport lines, a heterogeneous fleet and time windows

In this paper, the authors investigate a new variant of the multi-commodity network flow problem, taking into consideration multiple transport lines and time windows. This variant arises in a city logistics environment, more specifically in a long-haul passenger transport system that is also used to transport urban freight. The authors propose two mixed integer programming models for two objective functions: minimization of network operational costs and minimization of travel times. Since the problems under study are non-deterministic polynomial-time (NP)-hard, the authors propose three size reduction heuristics. In order to assess the performance of the proposed algorithms, the authors carried out computational experiments on a set of synthetic problem instances. They use the relative percentage deviation as performance criterion. For the cost objective function, a LP-and-Fix algorithm outperforms other methods in most tested instances, but for the travel time, a hybrid method (size reduction with LP-and-Fix algorithm) is, in general, better than other approaches.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • © 2020 Informa UK Limited, trading as Taylor & Francis Group. Abstract reprinted with permission of Taylor & Francis.
  • Authors:
    • Guimarães, Lucas Rebouças
    • Pinho de Sousa, Jorge
    • Prata, Bruno de Athayde
  • Publication Date: 2022-2

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01839933
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 24 2022 5:26PM