Advanced search
Publication Cover
Journal of the Operational Research Society Volume 62, 2011 - Issue 4
Submit an article Journal homepage
50
Views
4
CrossRef citations to date
0
Altmetric
Technical Note

An adaptive routing strategy for freight transportation networks

N ShiSchool of Business, Sun Yat-Sen UniversityGuangzhouChina
,
R K CheungThe Hong Kong University of Science and TechnologyHong KongChina
,
H XuSchool of Management, Huazhong University of Science and TechnologyWuhanChinaCorrespondence[email protected]
&
K K LaiCity University of Hong KongHong KongChina
Pages 799-805 | Received 01 Jul 2008, Accepted 01 Dec 2009, Published online: 21 Dec 2017

References

  • AndreattaGRomeoLStochastic shortest paths with recourseNetworks198818319320410.1002/net.3230180306
  • AzaronAKianfarFDynamic shortest path in stochastic dynamic networks: Ship routing problemEur J Opl Res200314413815610.1016/S0377-2217(01)00385-X
  • BanderJWhiteCA heuristic search approach for a nonstationary stochastic shortest path problem with terminal costTransport Sci20023621823010.1287/trsc.36.2.218.562
  • BellmanROn a routing problemQuart Appl Math1958168890
  • Bertsekas D (2001). Dynamic Programming and Optimal Control: 2nd edn, Vol. 1–2, Athena Scientific: Belmont, MA.
  • CheungRIterative methods for dynamic stochastic shortest path problemsNav Res Log19984576978910.1002/(SICI)1520-6750(199812)45:8<769::AID-NAV2>3.0.CO;2-#
  • CheungRMuralidharanBDynamic routing for priority shipments in LTL service networksTransport Sci2000341869810.1287/trsc.34.1.86.12279
  • CheungRPowellWSHAPE—a stochastic hybrid approximation procedure for two-stage stochastic programsOpns Res2000481737910.1287/opre.48.1.73.12452
  • CroucherJA note on the stochastic shortest route problemNav Res Log Quart19782572973210.1002/nav.3800250415
  • HallRThe fastest path through a network with random time-dependent travel timesTransport Sci19862018218810.1287/trsc.20.3.182
  • IoannouGKritikosMPrastacosGMap-route: A GIS-based decision support system for intra-city vehicle routing with time windowsJ Opl Res Soc20025384285410.1057/palgrave.jors.2601375
  • PattanamekarPParkDRilettLLeeJLeeCDynamic and stochastic shortest path in transportation networks with two components of travel time uncertaintyTransport Res Part C20031133135410.1016/S0968-090X(03)00029-9
  • PolychronopoulosGTsitsiklisJStochastic shortest path problems with recourseNetworks199627213314310.1002/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L
  • PopeJTerryRReesLCrouchWA network simulation of high-congestion road-traffic flows in cities with marine container terminalsJ Opl Res Soc1995461090110110.1057/jors.1995.153
  • ProvanJA polynomial-time algorithm to find shortest paths with recourseNetworks200341211512510.1002/net.10063
  • PsaraftisHTsitsiklisJDynamic shortest paths in acyclic networks with Markovian arc costsOpns Res1993419110110.1287/opre.41.1.91

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.