A Nonlinear Integer Programming Model for Warehousing Sustainable Logistics

2016 ◽  
pp. 99-107 ◽  
Author(s):  
Francesco Boenzi ◽  
Salvatore Digiesi ◽  
Francesco Facchini ◽  
Giorgio Mossa ◽  
Giovanni Mummolo
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Integer Programming Model ◽  
Sustainable Logistics

scholarly journals A Nonlinear Integer Programming Model for Integrated Location, Inventory, and Routing Decisions in a Closed-Loop Supply Chain

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Hao Guo ◽  
Congdong Li ◽  
Ying Zhang ◽  
Chunnan Zhang ◽  
Yu Wang
Keyword(s):  
Supply Chain ◽  
Integer Programming ◽  
Facility Location ◽  
Vehicle Routing ◽  
Closed Loop ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Inventory Routing ◽  
Closed Loop Supply Chain ◽  
Integer Programming Model

Facility location, inventory management, and vehicle routing are three important decisions in supply chain management, and location-inventory-routing problems consider them jointly to improve the performance and efficiency of today’s supply chain networks. In this paper, we study a location-inventory-routing problem to minimize the total cost in a closed-loop supply chain that has forward and reverse logistics flows. First, we formulate this problem as a nonlinear integer programming model to optimize facility location, inventory control, and vehicle routing decisions simultaneously in such a system. Second, we develop a novel heuristic approach that incorporates simulated annealing into adaptive genetic algorithm to solve the model efficiently. Last, numerical analysis is presented to validate our solution approach, and it also provides meaningful managerial insight into how to improve the closed-loop supply chain under study.

Paratransit Service Optimization for Special Events

2005 ◽  
Vol 1903 (1) ◽  
pp. 64-77
Author(s):  
Matthew G. Karlaftis ◽  
Konstantinos L. Kepaptsoglou ◽  
Antony Stathopoulos
Keyword(s):  
Integer Programming ◽  
Travel Time ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Time Constraints ◽  
Microsoft Excel ◽  
Integer Programming Model ◽  
Special Events ◽  
User Friendly ◽  
Service Optimization

Paratransit services can be useful for special events, especially when private vehicles are discouraged from approaching the event locations. During the Athens 2004 Olympics, such a shuttle service was planned to connect major Athens spots with athletic complexes. A mixed nonlinear integer programming model is developed for jointly obtaining optimal headways and vehicle types for such a paratransit service, given demand, resource, and travel time constraints. The model is incorporated into a user-friendly Microsoft Excel–based interface. An application of the model to the Athens 2004 Olympics and its results are presented and discussed.

scholarly journals Urban Rail Timetable Optimization to Improve Operational Efficiency with Flexible Routing Plans: A Nonlinear Integer Programming Model

2019 ◽  
Vol 11 (13) ◽  
pp. 3701 ◽  
Author(s):  
Qiuchi Xue ◽  
Xin Yang ◽  
Jianjun Wu ◽  
Huijun Sun ◽  
Haodong Yin ◽  
...  
Keyword(s):  
Integer Programming ◽  
Waiting Time ◽  
Optimization Model ◽  
Programming Model ◽  
Urban Rail Transit ◽  
Nonlinear Integer Programming ◽  
Load Factor ◽  
Integer Programming Model ◽  
Passenger Flow ◽  
Urban Rail

At present, most urban rail transit systems adopt an operation mode with a single long routing. The departure frequency is determined by the maximum section passenger flow. However, when the passenger flow varies greatly within different sections, this mode will lead to a low load factor in some sections, resulting in a waste of capacity. In view of this situation, this paper develops a nonlinear integer programming model to determine an optimal timetable with a balanced scheduling mode, where the wasted capacity at a constant departure frequency can be reduced with a slight increase in passenger waiting time. Then, we simplify the original model into a single-objective integer optimization model through normalization. A genetic algorithm is designed to find the optimal solution. Finally, a numerical example is presented based on real-world passenger and operation data from Beijing Metro Line 4. The results show that the double-routing optimization model can reduce wasted capacity by 9.5%, with a 4.5% increase in passenger waiting time, which illustrates the effectiveness of this optimization model.

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.

Sign in / Sign up

Export Citation Format

Share Document