**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**13

# Integer Programming Related Publications

##### 13 Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem

**Authors:**
Vijaya K. Srivastava,
Davide Spinello

**Abstract:**

This paper presents established 3** ^{n}** enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method.

**Keywords:**
Multi-objective optimization,
Integer Programming,
mixed integer programming,
Reliability Redundancy Allocation

##### 12 Optimizing Logistics for Courier Organizations with Considerations of Congestions and Pickups: A Courier Delivery System in Amman as Case Study

**Authors:**
Nader A. Al Theeb,
Zaid Abu Manneh,
Ibrahim Al-Qadi

**Abstract:**

Traveling salesman problem (TSP) is a combinatorial integer optimization problem that asks "What is the optimal route for a vehicle to traverse in order to deliver requests to a given set of customers?”. It is widely used by the package carrier companies’ distribution centers. The main goal of applying the TSP in courier organizations is to minimize the time that it takes for the courier in each trip to deliver or pick up the shipments during a day. In this article, an optimization model is constructed to create a new TSP variant to optimize the routing in a courier organization with a consideration of congestion in Amman, the capital of Jordan. Real data were collected by different methods and analyzed. Then, concert technology - CPLEX was used to solve the proposed model for some random generated data instances and for the real collected data. At the end, results have shown a great improvement in time compared with the current trip times, and an economic study was conducted afterwards to figure out the impact of using such models.

**Keywords:**
Service Engineering,
Integer Programming,
travel salesman problem,
congestions,
pick-up,
package carriers

##### 11 Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing

**Authors:**
Taehan Lee

**Abstract:**

**Keywords:**
Routing,
Integer Programming,
shortest path,
multicommodity network
design

##### 10 A Survey on the Requirements of University Course Timetabling

**Authors:**
Nurul Liyana Abdul Aziz,
Nur Aidya Hanum Aizam

**Abstract:**

**Keywords:**
Preferences,
Constraints,
Integer Programming,
university course timetabling problem

##### 9 Airport Check-In Optimization by IP and Simulation in Combination

**Authors:**
Ahmad Thanyan Al-Sultan

**Abstract:**

The check-in area of airport terminal is one of the busiest sections at airports at certain periods. The passengers are subjected to queues and delays during the check-in process. These delays and queues are due to constraints in the capacity of service facilities. In this project, the airport terminal is decomposed into several check-in areas. The airport check-in scheduling problem requires both a deterministic (integer programming) and stochastic (simulation) approach. Integer programming formulations are provided to minimize the total number of counters in each check-in area under the realistic constraint that counters for one and the same flight should be adjacent and the desired number of counters remaining in each area should be fixed during check-in operations. By using simulation, the airport system can be modeled to study the effects of various parameters such as number of passengers on a flight and check-in counter opening and closing time.

**Keywords:**
Simulation,
Scheduling,
Integer Programming,
airport terminal

##### 8 A Novel Solution Methodology for Transit Route Network Design Problem

**Authors:**
Ghada Moussa,
Mamoud Owais

**Abstract:**

Transit route Network Design Problem (TrNDP) is the most important component in Transit planning, in which the overall cost of the public transportation system highly depends on it. The main purpose of this study is to develop a novel solution methodology for the TrNDP, which goes beyond pervious traditional sophisticated approaches. The novelty of the solution methodology, adopted in this paper, stands on the deterministic operators which are tackled to construct bus routes. The deterministic manner of the TrNDP solution relies on using linear and integer mathematical formulations that can be solved exactly with their standard solvers. The solution methodology has been tested through Mandl’s benchmark network problem. The test results showed that the methodology developed in this research is able to improve the given network solution in terms of number of constructed routes, direct transit service coverage, transfer directness and solution reliability. Although the set of routes resulted from the methodology would stand alone as a final efficient solution for TrNDP, it could be used as an initial solution for meta-heuristic procedures to approach global optimal. Based on the presented methodology, a more robust network optimization tool would be produced for public transportation planning purposes.

**Keywords:**
Urban Planning,
Transportation,
Integer Programming,
transit route design

##### 7 A Dual Fitness Function Genetic Algorithm: Application on Deterministic Identical Machine Scheduling

**Authors:**
Saleem Z. Ramadan,
Gürsel A. Süer

**Abstract:**

In this paper a genetic algorithm (GA) with dual-fitness function is proposed and applied to solve the deterministic identical machine scheduling problem. The mating fitness function value was used to determine the mating for chromosomes, while the selection fitness function value was used to determine their survivals. The performance of this algorithm was tested on deterministic identical machine scheduling using simulated data. The results obtained from the proposed GA were compared with classical GA and integer programming (IP). Results showed that dual-fitness function GA outperformed the classical single-fitness function GA with statistical significance for large problems and was competitive to IP, particularly when large size problems were used.

**Keywords:**
Genetic Algorithms,
Machine Scheduling,
Integer Programming,
number of tardy jobs,
Due dates,
Number of early jobs,
Dual Fitness functions

##### 6 An Algorithm for an Optimal Staffing Problem in Open Shop Environment

**Authors:**
Ivan C. Mustakerov,
Daniela I. Borissova

**Abstract:**

**Keywords:**
Integer Programming,
open shop problem,
optimal
staffing

##### 5 Transformation of Course Timetablinng Problem to RCPSP

**Authors:**
M. Ahmad,
M. Gourgand,
C. Caux

**Abstract:**

**Keywords:**
Integer Programming,
Course Timetabling,
Combinatorial optimizations

##### 4 A new Heuristic Algorithm for the Dynamic Facility Layout Problem with Budget Constraint

**Authors:**
Parham Azimi,
Hamid Reza Charmchi

**Abstract:**

**Keywords:**
Simulation,
Integer Programming,
Budget constraint,
Dynamic facility layout problem

##### 3 Mathematical Model and Solution Algorithm for Containership Operation/Maintenance Scheduling

**Authors:**
Hun Go,
Ji-Su Kim,
Dong-Ho Lee

**Abstract:**

**Keywords:**
heuristic,
Integer Programming,
Containerships,
operation and preventive maintenance
schedules

##### 2 A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times

**Authors:**
Jinghao Sun,
Guozhen Tan,
Guangjian Hou

**Abstract:**

**Keywords:**
Integer Programming,
time dependent,
upper bound analysis,
Chinese Postman Problem

##### 1 Optimal Control Problem, Quasi-Assignment Problem and Genetic Algorithm

**Authors:**
Akbar H. Borzabadi,
Omid S. Fard

**Abstract:**

**Keywords:**
Optimal Control,
Genetic Algorithm,
Linear Programming,
Integer Programming,
Discrete approximation