Advertisement

Integer Programming Based Approaches for Multi-Trip Location Routing

  • Rita Macedo
  • Bruna Ramos
  • Cláudio Alves
  • José Valério de Carvalho
  • Saïd Hanafi
  • Nenad Mladenović
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 682)

Abstract

The multi-trip location routing problem consists in selecting the depots to open and the routes that should be performed to serve a set of clients at minimum cost. The multi-trip variant considers the possibility for a vehicle to perform more than a single route during the planning period, and hence it applies typically to cases in which the trips are performed within a small geographic area and involves for example the transportation of perishable goods. As a consequence, the inherent complexity of the problem increases as it has now to determine which routes should be assigned to the vehicles. In this paper, we explore an improved network flow formulation for this problem, and we compare it with another compact formulation proposed in the literature. We describe also an iterative rounding heuristic that relies on this model. We show through computational experiments on benchmark instances that the model provides good lower bounds, and that it can be used both by commercial solvers and heuristics to derive good quality solutions for the problem.

Keywords

Column Generation Planning Period Valid Inequality Linear Relaxation Benchmark Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

This work was supported by FEDER funding through the Programa Operacional Factores de Competitividade—COMPETE and by national funding through the Portuguese Science and Technology Foundation (FCT) in the scope of the project PTDC/EGE-GES/116676/2010 (Ref. COMPETE: FCOMP-01-0124-FEDER-020430).

References

  1. 1.
    Akca, Z., Berger, R., Ralphs, T.: Modeling and solving location routing and scheduling problems. Technical Report (2008)Google Scholar
  2. 2.
    Clautiaux, F., Alves, C., Valério de Carvalho, J.M.: A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179, 317–342 (2010)Google Scholar
  3. 3.
    Lin, C., Chow, C., Chen, C.: A location-routing-loading problem for bill delivery services. Comput. Ind. Eng. 43, 5–25 (2002)CrossRefGoogle Scholar
  4. 4.
    Lin, C., Kwok, C.R.: Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. Eur. J. Oper. Res. 175, 1833–1849 (2006)CrossRefGoogle Scholar
  5. 5.
    Macedo, R.: Models and algorithms for hard optimization problems. Ph.D. thesis, Universidade do Minho, Braga (2011)Google Scholar
  6. 6.
    Macedo, R., Alves, C., Valério de Carvalho, J.M.: An exact approach for the location routing problem with multiple routes. In: Proceedings of the International Conference on Engineering UBI2011 “Innovation and Development” - ICEUBI2011, Covilhã (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Rita Macedo
    • 1
  • Bruna Ramos
    • 2
  • Cláudio Alves
    • 2
  • José Valério de Carvalho
    • 2
  • Saïd Hanafi
    • 1
  • Nenad Mladenović
    • 1
  1. 1.Université de ValenciennesValenciennesFrance
  2. 2.Universidade do MinhoBragaPortugal

Personalised recommendations