Hybrid Coding Collaborative DE-ACO Algorithm for Solving Mixed-Integer Programming Problems

Yuelin Gao; Xia Chang; Junmei Liu
January 2014
Journal of Computers;Jan2014, Vol. 9 Issue 1, p101
Academic Journal
This paper presents a hybrid coding collaborative ant colony-differential evolution algorithm for solving bound constrained mixed integer programming problems. In this algorithm, a real number and integer hybrid coding strategy is used, and the population evolution is realized by colony optimization and differential evolution. It is shown by numerical experiments that the proposed algorithm is effective. The proposed algorithm is combined with penalty function method to solved the general mixed integer programming problems. Numerical experiments show that the proposed method achieves satisfactory results.


Related Articles

  • Immune Genetic Algorithm for Supply Chain Logistics Network Optimization Problem. Liang Yong; Qiao Pei-Li; Wei Wei; Luo Zhi-Yong // International Journal of Advancements in Computing Technology;Apr2013, Vol. 5 Issue 8, p532 

    This paper proposed a new kind of algorithm for supply chain logistics network optimization problem, which is immune genetic algorithm (IGA), because of the limitation of the premature convergence and the slow-evolutionary for simple genetic algorithm (SGA). Considering comprehensive factors of...

  • Application of Ant Colony Algorithm in Multi-objective Optimization Problems. Juan Li; Xianghong Tian // Telkomnika;Sep2015, Vol. 13 Issue 3, p1029 

    In actual application and scientific research, multi-objective optimization is an extremely important research subject. In reality, many issues are related to the simultaneous optimization under multi-objective conditions. The research subject of multi-objective optimization is getting...

  • Enhanced Ant Colony Optimization for Inventory Routing Problem. Wong, Lily; Moin, Noor Hasnah // AIP Conference Proceedings;2015, Vol. 1682 Issue 1, p1 

    The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying...

  • Finished-vehicle transporter routing problem solved by loading pattern discovery. Hu, Zhi-Hua; Zhao, Yingxue; Tao, Sha; Sheng, Zhao-Han // Annals of Operations Research;Nov2015, Vol. 234 Issue 1, p37 

    This work addresses a new transportation problem in outbound logistics in the automobile industry: the finished-vehicle transporter routing problem (FVTRP). The FVTRP is a practical routing problem with loading constraints, and it assumes that dealers have deterministic demands for finished...

  • An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility. Yu, Lianfei; Zhu, Cheng; Shi, Jianmai; Zhang, Weiming // Scientific Programming;2/13/2017, p1 

    Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and...

  • Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up. Rieck, Julia; Zimmermann, Jürgen // Business Research;May2013, Vol. 6 Issue 1, p77 

    In reverse logistics networks, products (e.g., bottles or containers) have to be transported from a depot to customer locations and, after use, from customer locations back to the depot. In order to operate economically beneficial, companies prefer a simultaneous delivery and pick-up service....

  • Preference-based assignment of university students to multiple teaching groups. Heitmann, Henrik; Brüggemann, Wolfgang // OR Spectrum;Jul2014, Vol. 36 Issue 3, p607 

    A successful approach to the student-scheduling problem is presented here. This problem arises naturally when courses and classes must be offered in such a large number of multiple teaching groups that some of these are timetabled in parallel, i.e. simultaneously. This is the case, for example,...

  • Dynamic facility layout problem based on flexible bay structure and solving by genetic algorithm. Mazinani, Mostafa; Abedzadeh, Mostafa; Mohebali, Navid // International Journal of Advanced Manufacturing Technology;Mar2013, Vol. 65 Issue 5-8, p929 

    Finding positions of departments on the plant floor for multiple periods while minimizing the sum of material handling and rearrangement costs is the base consideration of dynamic facility layout problems (DFLP). In this paper, a new kind of DFLP using flexible bay structure is studied. In a...

  • MineLib: a library of open pit mining problems. Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p93 

    Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics