scholarly journals An integrated integer programming model with a simulated annealing heuristic for the carrier vehicle traveling salesman problem

2022 ◽  
Vol 197 ◽  
pp. 301-308
Author(s):  
Maharani Rizki Larasati ◽  
I-Lin Wang
Keyword(s):  
Simulated Annealing ◽  
Integer Programming ◽  
Traveling Salesman Problem ◽  
Programming Model ◽  
Traveling Salesman ◽  
Integer Programming Model ◽  
Carrier Vehicle

scholarly journals Integer Programming Model for Two-Centered Double Traveling Salesman Problem

2016 ◽  
Vol 5 (1) ◽  
pp. 80
Author(s):  
Mehmet Fatih Demiral ◽  
Halil Şen
Keyword(s):  
Simulated Annealing ◽  
Integer Programming ◽  
Traveling Salesman Problem ◽  
Programming Model ◽  
Combinatorial Problems ◽  
Traveling Salesman ◽  
Single Node ◽  
Integer Programming Model ◽  
Numerical Example ◽  
Optimum Parameters

Traveling Salesman Problem (TSP) is among the most popular combinatorial problems and has been widely studied with many extensions in the literature. There have been integer programming formulations and solution approaches for TSP and its variations. One of the most popular topics is the multiple TSP (m-TSP). It has been started to work on the last decades. Generally, m-TSP has a single depot and more than one tour. However, some types have more than one depot. Besides, if seeking, many encounter with double traveling salesman problem (d-TSP). As inferred from the literature, d-TSP is a variation of m-TSP in which two salespersons operate in parallel. They start and end either in a single or two depots. Apart from the literature, a new TSP model has been constructed in this study. The model analyzes the behaviors of traveling salesmen both in the main and secondary tour. Tours have been aggregated via single node existing in the secondary tour. In the application part, Simulated Annealing (SA) was used to optimize the traveling paths of salesmen. The objective parameters of both tours have been explored within a numerical example. According to them, several cost values have been found. The optimum parameters and costs of both tours are to be determined and some practical issues relevant to the behaviors of traveling salesmen have been given. Results suggest that alternative travel plans of traveling salesmen could be possible. Also, findings give hints about both tours and their characteristics.

scholarly journals Reshuffle minimisation to improve storage yard operations efficiency

2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Heuristic Approach ◽  
Container Terminals ◽  
Exact Method ◽  
Computational Results ◽  
Binary Integer Programming ◽  
Integer Programming Model ◽  
Compatibility Test ◽  
Storage Area

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.

scholarly journals Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 219
Author(s):  
Dhananjay Thiruvady ◽  
Kerri Morgan ◽  
Susan Bedingfield ◽  
Asef Nazari
Keyword(s):  
Integer Programming ◽  
Gender Equity ◽  
Programming Model ◽  
Original Data ◽  
Ant Colony ◽  
Ant Colony Optimisation ◽  
Integer Programming Model ◽  
Problem Instances ◽  
Work Integrated Learning ◽  
Time Required

The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more engaged when they are allocated students that meet their industry requirements. In this paper, both an integer programming model and an ant colony optimisation heuristic are proposed, with the aim of automating the allocation of students to industry placements. The emphasis is on maximising student engagement and industry partner satisfaction. As part of the objectives, these methods incorporate diversity in industry sectors for students undertaking multiple placements, gender equity across placement providers, and the provision for partners to rank student selections. The experimental analysis is in two parts: (a) we investigate how the integer programming model performs against manual allocations and (b) the scalability of the IP model is examined. The results show that the IP model easily outperforms the previous manual allocations. Additionally, an artificial dataset is generated which has similar properties to the original data but also includes greater numbers of students and placements to test the scalability of the algorithms. The results show that integer programming is the best option for problem instances consisting of less than 3000 students. When the problem becomes larger, significantly increasing the time required for an IP solution, ant colony optimisation provides a useful alternative as it is always able to find good feasible solutions within short time-frames.

Research on the Freight Station Layout

2013 ◽  
Vol 380-384 ◽  
pp. 4506-4510
Author(s):  
Miao Du ◽  
Yong Qin ◽  
Zi Yang Wang ◽  
Zhong Xin Zhao ◽  
Hong Fei Yu ◽  
...  
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Programming Model ◽  
Rapid Expansion ◽  
Mixed Integer ◽  
Railway Stations ◽  
Integer Programming Model ◽  
Rail Freight ◽  
Mixed Integer Programming Model ◽  
Train Operation

At present, there are many problems existing in railway stations, such as excessive numbers and over-crowded layout, which seriously affect the scale benefit generation and rapid expansion of rail freight capacity. Aimed at these problems, a Mixed Integer programming model is proposed. Taking Lanzhou train operation depot for example, applying lingo software, the layout of freight station is obtained.

scholarly journals Optimization of Classification Track Assignment Considering Block Sequence at Train Marshaling Yard

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Yingqun Zhang ◽  
Rui Song ◽  
Shiwei He ◽  
Haodong Li ◽  
Xiaole Guo
Keyword(s):  
Integer Programming ◽  
Numerical Experiment ◽  
Real World ◽  
Programming Model ◽  
Block Sequence ◽  
Operational Process ◽  
Integer Programming Model ◽  
The Real ◽  
Reasonable Amount ◽  
Number Of Factors

An operational process at train marshaling yard is considered in this study. The inbound trains are decoupled and disassembled into individual railcars, which are then moved to a series of classification tracks, forming outbound trains after being assembled and coupled. We focus on the allocation plan of the classification tracks. Given are the disassembling and assembling sequence, the railcars connection plan, and a number of classification tracks. Output is the assignment of the railcars to the classification tracks. An integer programming model is proposed, aimed at reducing the number of coupling operations, as well as the number of dirty tracks which is related to the rehumping operation, and the order of the railcars on the outbound train must satisfy the block sequence. Tabu algorithm is designed to solve the problem, and the model is also tested by CPLEX in comparison. A numerical experiment based on a real-world case is analyzed, and the result can be reached within a reasonable amount of time. We also discussed a number of factors that may affect the track assignment and gave suggestions for the real-world case.

Sign in / Sign up

Export Citation Format

Share Document