A hybrid algorithm for solving network flow problems with side constraints

被引：10
|
作者：
Mathies, S [1 ]
Mevert, P [1 ]
机构：
[1] Free Univ Berlin, D-14195 Berlin, Germany
来源：
COMPUTERS & OPERATIONS RESEARCH | 1998年 / 25卷 / 09期
关键词：
network optimization; side constraints; basis partitioning;
D O I：
10.1016/S0305-0548(98)00001-X
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider network flow problems with few additional linear side constraints. Three approaches for solving such problems are presented. The first method is a specialized Simplex Algorithm with primal partitioning of the basis. Secondly, Lagrangean relaxation is used, solving the dual problem by subgradient optimization. Finally, good starting solutions are generated by relaxing the side constraints, solving the resulting pure network problem, and using the solution of the pure network problem as an advanced start for a general LP-optimizer. Numerical tests show that a hybrid combination of Lagrangean relaxation and subsequent optimization by primal partitioning is most efficient. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：745 / 756
页数：12
相关论文
共 50 条
  • [41] Hybrid Evolutionary Algorithm for Solving Global Optimization Problems
    Thangaraj, Radha
    Pant, Millie
    Abraham, Ajith
    Badr, Youakim
    HYBRID ARTIFICIAL INTELLIGENCE SYSTEMS, 2009, 5572 : 310 - +
  • [42] A hybrid evolutionary algorithm for solving function optimization problems
    Gu, Fahui
    Li, Kangshun
    Liu, Yue
    PROCEEDINGS OF 2016 12TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2016, : 526 - 529
  • [43] A hybrid direction algorithm for solving optimal control problems
    Zaitri, Mohamed Abdelaziz
    Bibi, Mohand Ouamer
    Bentobache, Mohand
    COGENT MATHEMATICS & STATISTICS, 2019, 6
  • [44] A Hybrid Search Algorithm for Solving Constraint Satisfaction Problems
    Hatamlou, Abdel-Reza
    Meybodi, Mohammad Reza
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 362 - +
  • [45] A MODIFIED HYBRID ALGORITHM FOR SOLVING PSEUDOMONOTONE EQUILIBRIUM PROBLEMS
    Suparatulatorn, Raweerote
    UPB Scientific Bulletin, Series A: Applied Mathematics and Physics, 2024, 86 (02): : 25 - 32
  • [46] An Improved Hybrid Firefly Algorithm for Solving Optimization Problems
    Wahid, Fazli
    Ghazali, Rozaida
    Shah, Habib
    RECENT ADVANCES ON SOFT COMPUTING AND DATA MINING (SCDM 2018), 2018, 700 : 14 - 23
  • [47] A parameter tuned hybrid algorithm for solving flow shop scheduling problems with parallel assembly stages
    Jabbari M.
    Tavana M.
    Fattahi P.
    Daneshamooz F.
    Sustainable Operations and Computers, 2022, 3 : 22 - 32
  • [48] Generating Large Scale Network for Solving the Flow Network Problems
    Chen, S. G.
    2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1728 - 1732
  • [49] A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints
    Cui, Wei-Wei
    Lu, Zhiqiang
    Zhou, Binghai
    Li, Chen
    Han, Xiaole
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2016, 29 (09) : 944 - 961
  • [50] On the hybrid neural network model for solving optimization problems
    Lect Notes Comput Sci, (182):
12345