Probabilistic local search algorithms for concave cost transportation network problems-Reference-Cited by-同舟云学术

Probabilistic local search algorithms for concave cost transportation network problems

Published:1999-09 Issue:3 Volume:117 Page:511-521
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Yan Shangyao,Luo So-Chang

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference26 articles.

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows, Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ

2. A 3-opt based simulated annealing algorithm for vehicle routing problems;Alfa;Computers Industrial Engineering,1991

3. Analyzing trade-offs between transportation, inventory, and production costs on freight networks;Blumenfeld;Transportation Research,1985

4. A random activity network generator;Demeulemeester;Operations Research,1993

5. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing;Dueck;Journal of Computational Physics,1990

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transport- und Tourenplanung;Handbuch Logistik;2023

2. DC programming and DCA for supply chain and production management: state-of-the-art models and methods;International Journal of Production Research;2019-08-29

3. Transport- und Tourenplanung;Planung logistischer Systeme;2018

4. Rental bike location and allocation under stochastic demands;Computers & Industrial Engineering;2017-05

5. A COMPARISON BETWEEN MILP AND MINLP APPROACHES TO OPTIMAL SOLUTION OF NONLINEAR DISCRETE TRANSPORTATION PROBLEM;TRANSPORT;2014-07-10