scholarly journals Optimization of the Classification Yard Location Problem Based on Train Service Network

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 872
Author(s):  
Yinan Zhao ◽  
Boliang Lin
Keyword(s):  
Capital Investment ◽  
Programming Model ◽  
Nonlinear Models ◽  
Parameter Setting ◽  
Binary Integer Programming ◽  
Service Network ◽  
Rail Network ◽  
Decision Variables ◽  
Nonlinear Joint ◽  
Classification Yard

This paper investigates the problems of locating yards and allocating works of train formation among yards based on the train service network. It not only involves the modifications of the scales of existing yards, either improving, or downsizing or even demolishing, but also the determinations of building new yards in a given rail network. Besides, the train service network is also taken into consideration, so that the car-hour costs that are incurred from the reclassification and accumulation operations of railcars can be optimized simultaneously. The accumulation parameter setting is symmetrical on both directions of traffic flows. A binary integer programming model is first proposed for optimizing the train service network, the solution of which is employed as a benchmark of the further integrated optimization. Based on this, a nonlinear joint optimization model is developed aiming at striking a balance between the capital investment and car-hour consumptions, with the constraints of the reclassification capacities of yards and the number of sorting tracks, and multiple logical relations among decision variables. Corresponding linearization techniques are introduced for transforming the nonlinear models into the linear ones. Finally, an exact solving approach is presented with computational results that are based on a real-world based case to illustrate the efficacy of the linear 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 THE WARSHIP ASSIGNMENT SCHEDULE USING INTEGER PROGRAMMING MODEL

JOURNAL ASRO ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 49
Author(s):  
Ahmadi Ahmadi ◽  
Benny Sukandari ◽  
Agus Mahrowi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Mathematical Formulation ◽  
Combinatorial Problem ◽  
Mathematical Methods ◽  
Alternative Scheduling ◽  
Integer Programming Model ◽  
Maintenance Schedule ◽  
Hard Constraints ◽  
Decision Variables

Scheduling is an assignment activity that deals with constraints. A number of events can occur in a period of time and location so that objective functions as close as possible can be fulfilled. In the hierarchy of decision making, scheduling is the last step before the start of an operation. Scheduling warship assignments in Kolinlamil are an interesting topic to discuss and find solutions to using mathematical methods. The process of the Kolinlamil warship assignment schedule was carried out to produce an annual shipbuilding schedule. This process not only requires fast follow-up, but also requires systematic and rigorous steps. Where the assignment schedule is a fairly complex combinatorial problem. While making the assignment schedule that is applied at this time is considered less accurate because it calculates the conventional method. The process of warship assignment schedule in this study using the Integer Programming model aims to obtain alternative scheduling operations. The schedule observed was 13 warships in carrying out N operations for 1 year (52 weeks). This research begins with determining the decision variables and limitations that existing constraints. Hard constraints include: maintenance schedule, time and duration of each task, warship class assigned to the task and the number of executing warships per task. While soft constraints are how long the warship performs its tasks in a row. The mathematical formulation of the Integer Programming model created consists of three indicator, one decision variables, two measuring parameters and five constraint functions. Furthermore, determining the best scheduling alternatives is completed using the Microsoft Exel Solver computing program.Keywords: Scheduling, Integer Programming, Solver.

scholarly journals Highway Passenger Transport Based Express Parcel Service Network Design: Model and Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Yuan Jiang ◽  
Baofeng Sun ◽  
Gendao Li ◽  
Zhibin Lin ◽  
Changxu Zheng ◽  
...  
Keyword(s):  
Network Design ◽  
Network Flow ◽  
Programming Model ◽  
Real Data ◽  
Path Selection ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Passenger Transport ◽  
Service Network ◽  
Time Space

Highway passenger transport based express parcel service (HPTB-EPS) is an emerging business that uses unutilised room of coach trunk to ship parcels between major cities. While it is reaping more and more express market, the managers are facing difficult decisions to design the service network. This paper investigates the HPTB-EPS network design problem and analyses the time-space characteristics of such network. A mixed-integer programming model is formulated integrating the service decision, frequency, and network flow distribution. To solve the model, a decomposition-based heuristic algorithm is designed by decomposing the problem as three steps: construction of service network, service path selection, and distribution of network flow. Numerical experiment using real data from our partner company demonstrates the effectiveness of our model and algorithm. We found that our solution could reduce the total cost by up to 16.3% compared to the carrier’s solution. The sensitivity analysis demonstrates the robustness and flexibility of the solutions of the model.

A multi-objective approach to design strategic supply chains and develop responsiveness- efficiency frontiers

2018 ◽  
Vol 29 (1) ◽  
pp. 365-386 ◽  
Author(s):  
Raed AlHusain ◽  
Reza Khorramshahgol
Keyword(s):  
Supply Chain ◽  
Integer Programming ◽  
Programming Model ◽  
Efficient Frontier ◽  
Decision Makers ◽  
Binary Integer Programming ◽  
Content Type ◽  
Strategic Fit ◽  
Cost Efficient ◽  
Alternative Solutions

Purpose The purpose of this paper is twofold. Initially, a multi-objective binary integer programming model is proposed for designing an appropriate supply chain that takes into consideration both responsiveness and efficiency. Then, a responsiveness-cost efficient frontier is generated for the supply chain design that can help organizations find the right balance between responsiveness and efficiency, and hence achieve a strategic fit between organizational strategy and supply chain capabilities. Design/methodology/approach The proposed SC design model used both cross-functional and logistical SC drivers to build a binary integer programming model. To this end, various alternative solutions that correspond to different SC design portfolios were generated and a responsiveness-cost efficient frontier was constructed. Findings Various alternative solutions that correspond to different SC designs were generated and a responsiveness-cost efficient frontier was constructed to help the decision makers to design SC portfolios to achieve a strategic fit between organizational strategy and SC capabilities. Practical implications The proposed methodology enables the decision makers to incorporate both qualitative and quantitative judgements in SC design. The methodology is easy to use and it can be readily implemented by a software. Originality/value The proposed methodology allows for subjective value judgements of the decision makers to be considered in SC design and the efficiency-responsiveness frontier generated by the methodology provides a trade-off to be used when choosing between speed and cost efficiency in SC design.

scholarly journals Congestion Service Facilities Location Problem with Promise of Response Time

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Dandan Hu ◽  
Zhi-Wei Liu ◽  
Wenshan Hu
Keyword(s):  
Response Time ◽  
Location Problem ◽  
Service Providers ◽  
Programming Model ◽  
Mixed Integer ◽  
Specific Response ◽  
Location Decision ◽  
Decision Variables ◽  
Facilities Location ◽  
Nonlinear Programming Model

In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.

The Dynamic Programming Model for Investment Decision of Enterprise

2014 ◽  
Vol 519-520 ◽  
pp. 1468-1471
Author(s):  
Jun Quan Gong ◽  
Xiao Hong Qin
Keyword(s):  
Genetic Algorithm ◽  
Dynamic Programming ◽  
Capital Investment ◽  
Programming Model ◽  
Investment Decision ◽  
Fuzzy Optimization ◽  
Optimal Investment ◽  
Financial Resources ◽  
Risks And Benefits ◽  
Dynamic Programming Model

Enterprise often face to limit financial resources but also have to consider how to invest effectively on a number of projects in the various factors of the risks and benefits in different periods. In order to assure the optimal investment results of capital investment, this paper has established dynamic programming model which is multi-dimensional and multi-objective and fuzzy optimization, dynamic programming and genetic algorithm is combination to solve investment decision of enterprise. At last, this paper through an example to verify the validity of dynamic programming model.

Sign in / Sign up

Export Citation Format

Share Document