scholarly journals Distance restricted maximal covering model for pharmacy duty scheduling problem

2018 ◽  
Vol 8 (2) ◽  
pp. 208-215
Author(s):  
Nuşin Uncu ◽  
Berna Bulğurcu ◽  
Fatih Kılıç
Keyword(s):  
Programming Model ◽  
Health Care Systems ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Weighted Distance ◽  
Maximal Covering ◽  
Proposed Model ◽  
Care Systems ◽  
Covering Model ◽  
The City

Pharmacies are considered as an integral part of health care systems for supplying medicine to patients. In order to access  medicine with ease, pharmacies locations in the context of distance and demand are important for patients. In the case of a few numbers of pharmacies may be on duty at nights or during holidays, pharmacies duty scheduling problem occur and can be associated with location models. In contrast to widely used p-median model which aims to minimize the demand-weighted distance, we maximize the demand covered over the distance between the patients and the pharmacies on duty. Main contribution of the proposed model is the restriction constraint for the distance between pharmacies on duty in order to ensure fairness in an organizational view of point. We propose a distance restricted maximal covering location model (DR-MCLM) in this study. This mathematical model is a mixed integer linear programming model and solved by Lingo optimization software. The distances between the pharmacies and the sites are obtained using Geographic Information Systems (GIS). The model is applied for the case in Adana, one of the biggest cities in Turkey. The results are given on the maps of the city, including the pharmacies on duty and their assignments to sites in each day of the period.

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

scholarly journals Soft Computing Methodology to Optimize the Integrated Dynamic Models of Cellular Manufacturing Systems in a Robust Environment

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Amir-Mohammad Golmohammadi ◽  
Hasan Rasay ◽  
Zaynab Akhoundpour Amiri ◽  
Maryam Solgi ◽  
Negar Balajeh
Keyword(s):  
Machine Learning ◽  
Programming Model ◽  
Facility Layout ◽  
Cell Formation ◽  
Layout Design ◽  
Metaheuristic Algorithms ◽  
Sensitivity Analyses ◽  
Mixed Integer ◽  
Facility Layout Design ◽  
Proposed Model

Machine learning, neural networks, and metaheuristic algorithms are relatively new subjects, closely related to each other: learning is somehow an intrinsic part of all of them. On the other hand, cell formation (CF) and facility layout design are the two fundamental steps in the CMS implementation. To get a successful CMS design, addressing the interrelated decisions simultaneously is important. In this article, a new nonlinear mixed-integer programming model is presented which comprehensively considers solving the integrated dynamic cell formation and inter/intracell layouts in continuous space. In the proposed model, cells are configured in flexible shapes during the planning horizon considering cell capacity in each period. This study considers the exact information about facility layout design and material handling cost. The proposed model is an NP-hard mixed-integer nonlinear programming model. To optimize the proposed problem, first, three metaheuristic algorithms, that is, Genetic Algorithm (GA), Keshtel Algorithm (KA), and Red Deer Algorithm (RDA), are employed. Then, to further improve the quality of the solutions, using machine learning approaches and combining the results of the aforementioned algorithms, a new metaheuristic algorithm is proposed. Numerical examples, sensitivity analyses, and comparisons of the performances of the algorithms are conducted.

scholarly journals Local Blood Supply Chain Optimization: A Case Study

2020 ◽  
Vol 18 (4) ◽  
Author(s):  
Reza Babazadeh ◽  
Ali Sabbaghnia ◽  
Fatemeh Shafipour
Keyword(s):  
Supply Chain ◽  
Blood Supply ◽  
Blood Donation ◽  
Programming Model ◽  
Human Life ◽  
Mixed Integer ◽  
Model Parameters ◽  
Supply Chain Optimization ◽  
Blood Supply Chain ◽  
Proposed Model

: Blood and its products play an undeniable role in human life. In recent years, although both academics and practitioners have investigated blood-related problems, further enhancement is still warranted. In this study, a mixed-integer linear programming model was proposed for local blood supply chain management. A supply network, including temporary and fixed blood donation facilities, blood banks, and blood processing centers, was designed regarding the deteriorating nature of blood. The proposed model was applied in a real case in Urmia, Iran. The numerical results and sensitivity analysis of the key model parameters ensured the applicability of the proposed model.

Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Oğuzhan Ahmet Arık
Keyword(s):  
Programming Model ◽  
Heuristic Method ◽  
Mixed Integer ◽  
Grey Theory ◽  
Scheduling Problem ◽  
Due Date ◽  
Content Type ◽  
Common Due Date ◽  
Processing Times ◽  
Uncertainty Of Parameters

PurposeThis paper presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem where the objective is to minimize total earliness/tardiness duration when the uncertainty of parameters such as processing times and due date is coded with grey numbers.Design/methodology/approachGrey theory and grey numbers are used for illustrating the uncertainty of parameters in processing times and common due date, where the objective is to minimize the total earliness/tardiness duration. The paper proposes a 0–1 mathematical model for the problem and an effective heuristic method for the problem by using expected processing times for ordering jobs.FindingsThe uncertainty of the processing times and common due date are encoded with grey numbers and a position-dependent mixed-integer mathematical programming model is proposed for the problem in order to minimize total grey earliness/tardiness duration of jobs having grey processing times and a common due date. By using expected processing times for ranking grey processing times, V-shaped property of the problem and an efficient heuristic method for the problem are proposed. Solutions obtained from the heuristic method show that the heuristic is effective. The experimental study also reveals that while differences between upper and lower bounds of grey processing times decrease, the proposed heuristic's performance decreases.Originality/valueThe grey theory and grey numbers have been rarely used as machine scheduling problems. Therefore, this study provides an important contribution to the literature.

scholarly journals Coordinated Production Planning and Scheduling Problem in a Foundry

2017 ◽  
Vol 17 (3) ◽  
pp. 133-138
Author(s):  
A. Stawowy ◽  
J. Duda
Keyword(s):  
Production Planning ◽  
Programming Model ◽  
Mixed Integer ◽  
Medium Size ◽  
Scheduling Problem ◽  
Planning And Scheduling ◽  
Alloy Casting ◽  
Production Planning And Scheduling ◽  
Multiple Cores ◽  
Molding Shop

Abstract In the paper, we present a coordinated production planning and scheduling problem for three major shops in a typical alloy casting foundry, i.e. a melting shop, molding shop with automatic line and a core shop. The castings, prepared from different metal, have different weight and different number of cores. Although core preparation does not required as strict coordination with molding plan as metal preparation in furnaces, some cores may have limited shelf life, depending on the material used, or at least it is usually not the best organizational practice to prepare them long in advance. Core shop have limited capacity, so the cores for castings that require multiple cores should be prepared earlier. We present a mixed integer programming model for the coordinated production planning and scheduling problem of the shops. Then we propose a simple Lagrangian relaxation heuristic and evolutionary based heuristic to solve the coordinated problem. The applicability of the proposed solution in industrial practice is verified on large instances of the problem with the data simulating actual production parameters in one of the medium size foundry.

scholarly journals Drone-Based Parcel Delivery Using the Rooftops of City Buildings: Model and Solution

2020 ◽  
Vol 10 (12) ◽  
pp. 4362 ◽  
Author(s):  
Junsu Kim ◽  
Hongbin Moon ◽  
Hosang Jung
Keyword(s):  
Urban Areas ◽  
Programming Model ◽  
Computation Time ◽  
Intelligent Transportation ◽  
Mixed Integer ◽  
Operation Planning ◽  
Logistics System ◽  
Proposed Model ◽  
Optimality Gap ◽  
Good Operation

In general, the demand for delivery cannot be fulfilled efficiently due to the excessive traffic in dense urban areas. Therefore, many innovative concepts for intelligent transportation of freight have recently been developed. One of these concepts relies on drone-based parcel delivery using rooftops of city buildings. To apply drone logistics system in cities, the operation design should be adequately prepared. In this regard, a mixed integer programming model for drone operation planning and a heuristic based on block stacking are newly proposed to provide solutions. Additionally, numerical experiments with three different problem sizes are conducted to check the feasibility of the proposed model and to assess the performance of the proposed heuristic. The experimental results show that the proposed model seems to be viable and that the developed heuristic provides very good operation plans in terms of the optimality gap and the computation time.

Network Design for Shipping Service of Large-Scale Intermodal Liners

2012 ◽  
Vol 2269 (1) ◽  
pp. 42-50 ◽  
Author(s):  
Qiang Meng ◽  
Shuaian Wang ◽  
Zhiyuan Liu
Keyword(s):  
Network Design ◽  
Large Scale ◽  
Programming Model ◽  
Transportation Network ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Mixed Integer ◽  
Hub And Spoke ◽  
Shipping Company ◽  
Proposed Model

A model was developed for network design of a shipping service for large-scale intermodal liners that captured essential practical issues, including consistency with current services, slot purchasing, inland and maritime transportation, multiple-type containers, and origin-to-destination transit time. The model used a liner shipping hub-and-spoke network to facilitate laden container routing from one port to another. Laden container routing in the inland transportation network was combined with the maritime network by defining a set of candidate export and import ports. Empty container flow is described on the basis of path flow and leg flow in the inland and maritime networks, respectively. The problem of network design for shipping service of an intermodal liner was formulated as a mixed-integer linear programming model. The proposed model was used to design the shipping services for a global liner shipping company.

Sign in / Sign up

Export Citation Format

Share Document