IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v117y1999i3p511-521.html
   My bibliography  Save this article

Probabilistic local search algorithms for concave cost transportation network problems

Author

Listed:
  • Yan, Shangyao
  • Luo, So-Chang

Abstract

No abstract is available for this item.

Suggested Citation

  • Yan, Shangyao & Luo, So-Chang, 1999. "Probabilistic local search algorithms for concave cost transportation network problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 511-521, September.
    • Handle: RePEc:eee:ejores:v:117:y:1999:i:3:p:511-521
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00270-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    3. Larry J. LeBlanc, 1976. "Global Solutions for a Nonconvex Nonconcave Rail Network Model," Management Science, INFORMS, vol. 23(2), pages 131-139, October.
    4. Gallo, Giorgio & Sandi, Claudio & Sodini, Claudio, 1980. "An algorithm for the min concave cost flow problem," European Journal of Operational Research, Elsevier, vol. 4(4), pages 248-255, April.
    5. Larsson, Torbjorn & Migdalas, Athanasios & Ronnqvist, Mikael, 1994. "A Lagrangean heuristic for the capacitated concave minimum cost network flow problem," European Journal of Operational Research, Elsevier, vol. 78(1), pages 116-129, October.
    6. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    7. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    8. E. Demeulemeester & B. Dodin & W. Herroelen, 1993. "A Random Activity Network Generator," Operations Research, INFORMS, vol. 41(5), pages 972-980, October.
    9. Robuste, Francesc & Daganzo, Carlos F. & Souleyrette, Reginald R., 1990. "Implementing vehicle routing models," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 263-286, August.
    10. Blumenfeld, Dennis E. & Burns, Lawrence D. & Diltz, J. David & Daganzo, Carlos F., 1985. "Analyzing trade-offs between transportation, inventory and production costs on freight networks," Transportation Research Part B: Methodological, Elsevier, vol. 19(5), pages 361-380, October.
    11. Heragu, Sunderesh S. & Alfa, Attahiru Sule, 1992. "Experimental analysis of simulated annealing based algorithms for the layout problem," European Journal of Operational Research, Elsevier, vol. 57(2), pages 190-202, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. F Altiparmak & I Karaoglan, 2008. "An adaptive tabu-simulated annealing for concave cost transportation problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 331-341, March.
    2. Shangyao Yan & Yu-Lin Shih & Wang-Tsang Lee, 2011. "A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems," Journal of Global Optimization, Springer, vol. 49(4), pages 539-559, April.
    3. Chauhan, Satyaveer Singh & Proth, Jean-Marie, 2003. "The concave cost supply problem," European Journal of Operational Research, Elsevier, vol. 148(2), pages 374-383, July.
    4. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    5. Vasilios I. Manousiouthakis & Neil Thomas & Ahmad M. Justanieah, 2011. "On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 121-134, October.
    6. Yan, Shangyao & Yang, Ta-Hui & Chen, Hsuan-Hung, 2004. "Airline short-term maintenance manpower supply planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(9-10), pages 615-642.
    7. Hsu, Chaug-Ing & Li, Hui-Chieh, 2009. "An integrated plant capacity and production planning model for high-tech manufacturing firms with economies of scale," International Journal of Production Economics, Elsevier, vol. 118(2), pages 486-500, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    2. F Altiparmak & I Karaoglan, 2008. "An adaptive tabu-simulated annealing for concave cost transportation problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 331-341, March.
    3. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    4. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    5. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    6. Chung‐Lun Li & Jinwen Ou & Vernon N. Hsu, 2012. "Dynamic lot sizing with all‐units discount and resales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 230-243, April.
    7. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    8. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Lai, Minghui & Cai, Xiaoqiang & Li, Xiang, 2017. "Mechanism design for collaborative production-distribution planning with shipment consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 137-159.
    10. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
    11. Önal, Mehmet & Romeijn, H.Edwin & Sapra, Amar & van den Heuvel, Wilco, 2015. "The economic lot-sizing problem with perishable items and consumption order preference," European Journal of Operational Research, Elsevier, vol. 244(3), pages 881-891.
    12. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.
    13. Guan, Yongpei & Liu, Tieming, 2010. "Stochastic lot-sizing problem with inventory-bounds and constant order-capacities," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1398-1409, December.
    14. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
    15. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    16. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    17. Van Breedam, Alex, 1995. "Improvement heuristics for the Vehicle Routing Problem based on simulated annealing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 480-490, November.
    18. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    19. Fontes, Dalila B.M.M. & Hadjiconstantinou, Eleni & Christofides, Nicos, 2006. "A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1205-1219, October.
    20. Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:117:y:1999:i:3:p:511-521. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.