Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints

@article{Dalfard2012TwoMA,
  title={Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints},
  author={Vahid Majazi Dalfard and Mojtaba Kaveh and Nasim Ekram Nosratian},
  journal={Neural Computing and Applications},
  year={2012},
  volume={23},
  pages={2341-2349}
}
In the present research, a two-echelon location-routing problem with constraints of vehicle fleet capacity and maximum route length is considered. The problem’s objective is to determine the location and number of two types of capacitated facilities, the size of two different vehicle fleets, and the related routes on each echelon. Two algorithms hybrid genetic algorithm and simulated annealing are then applied to solve the problem. Results of numerical experiments show that the applied hybrid… CONTINUE READING
9 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Scutell AMG (2005) Distribution network design new problems and related models

  • D Ambrosino
  • Eur J Oper Res
  • 2005
Highly Influential
4 Excerpts

A warehouse location-routing problem

  • J Perl, MS Daskin
  • Transportation Res B
  • 1985
Highly Influential
4 Excerpts

Adjustment of the primitive parameters of the simulated annealing heuristic

  • V Majazi
  • Ind J Sci Tech
  • 2011
1 Excerpt

Locationrouting models for designing a two-echelon freight distribution system

  • M Boccia, TG Crainic, A Sforza, C Sterle
  • Technical report CIRRELT 2011-6,
  • 2011
3 Excerpts

Ant colony optimization based heuristic for one-sided time constraint vehicle routing problem

  • M Saravanan, KA Sundararaman
  • Int J Serv Econ Manag
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…