A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-010-9548-2
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Yan, Shangyao & Yang, Dah-Hwei, 1996. "A decision support framework for handling schedule perturbation," Transportation Research Part B: Methodological, Elsevier, vol. 30(6), pages 405-419, December.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Shuvomoy Das Gupta & Lacra Pavel, 2019. "On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems," Journal of Global Optimization, Springer, vol. 74(3), pages 523-548, July.
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.- 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.
- Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
- 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.
- 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.
- Bard, Jonathan F. & Mohan, Dinesh Natarajan, 2008. "Reallocating arrival slots during a ground delay program," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 113-134, February.
- Vincenzo Bonifaci & Tobias Harks & Guido Schäfer, 2010. "Stackelberg Routing in Arbitrary Networks," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 330-346, May.
- Brouer, Berit D. & Dirksen, Jakob & Pisinger, David & Plum, Christian E.M. & Vaaben, Bo, 2013. "The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping," European Journal of Operational Research, Elsevier, vol. 224(2), pages 362-374.
- 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.
- AlKheder, Sharaf, 2021. "Passengers intentions towards self-services check-in, Kuwait airport as a case study," Technological Forecasting and Social Change, Elsevier, vol. 169(C).
- Abdelghany, Khaled F. & Abdelghany, Ahmed F. & Ekollu, Goutham, 2008. "An integrated decision support tool for airlines schedule recovery during irregular operations," European Journal of Operational Research, Elsevier, vol. 185(2), pages 825-848, March.
- Zhang, Yu, 2008. "Real-time Inter-modal Strategies for Airline Schedule Perturbation Recovery and Airport Congestion Mitigation under Collaborative Decision Making (CDM)," University of California Transportation Center, Working Papers qt2k44c9tx, University of California Transportation Center.
- 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.
- Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
- Shangyao Yan & Chun-Ying Chen, 2011. "An optimization model and a solution algorithm for the many-to-many car pooling problem," Annals of Operations Research, Springer, vol. 191(1), pages 37-71, November.
- Huang, Lei & Xiao, Fan & Zhou, Jing & Duan, Zhenya & Zhang, Hua & Liang, Zhe, 2023. "A machine learning based column-and-row generation approach for integrated air cargo recovery problem," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
- Huang, Zhouchun & Luo, Xiaodong & Jin, Xianfei & Karichery, Sureshan, 2022. "An iterative cost-driven copy generation approach for aircraft recovery problem," European Journal of Operational Research, Elsevier, vol. 301(1), pages 334-348.
- 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.
- Yan, Shangyao & Tu, Yu-Ping, 2002. "A network model for airline cabin crew scheduling," European Journal of Operational Research, Elsevier, vol. 140(3), pages 531-540, August.
- Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
- Jane Lee & Lavanya Marla & Alexandre Jacquillat, 2020. "Dynamic Disruption Management in Airline Networks Under Airport Operating Uncertainty," Transportation Science, INFORMS, vol. 54(4), pages 973-997, July.
More about this item
Keywords
Concave arc cost network flow problem; Hybrid algorithm; Particle swarm optimization; Genetic algorithm; Threshold accepting;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:jglopt:v:49:y:2011:i:4:p:539-559. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.