Appropriate traffic coordination at intersections where multiple roads merge plays an important role in modern intelligent transportations systems. In this paper, we try to propose an efficient traffic coordination fr...
详细信息
ISBN:
(纸本)9789811365089;9789811365072
Appropriate traffic coordination at intersections where multiple roads merge plays an important role in modern intelligent transportations systems. In this paper, we try to propose an efficient traffic coordination framework using multiple collision sets. Aiming at the essentially non-convex problem, we try to reformulate the original problem into a mixedbinaryinteger quadratic programming one by proper relaxations. Low complexity solutions are also given afterwards. Numeric results show that the traffic throughput at intersections can be significantly improved compared to the existing investigations.
This paper studies a single-machine scheduling problem observed in the wafer manufacturing process, where the machine must receive periodical maintenance so that the dirt generated in the process does not exceed the l...
详细信息
This paper studies a single-machine scheduling problem observed in the wafer manufacturing process, where the machine must receive periodical maintenance so that the dirt generated in the process does not exceed the limit. The objective is to minimize the total completion times. A mixed binary integer programming model is formulated, and, due to its computational intractability for large problems, three effective heuristics are proposed based on our developed properties. The proposed heuristics are evaluated by comparison with exact solutions on small problems and with lower bounds on large problems. The experimental results show that the INDEX-LOE heuristic yields high-quality solutions in comparison with those obtained from the other two heuristics. Furthermore, the impacts of dirt accumulation and cleaning time are discussed in detail.
One of the concepts that has gained important attention from economic and management-science research is that of the concept of returns to scale (RTS). There are several research papers on the behavior of the right an...
详细信息
One of the concepts that has gained important attention from economic and management-science research is that of the concept of returns to scale (RTS). There are several research papers on the behavior of the right and left RTS, as two specific directions of RTS, based on Data Envelopment Analysis (DEA) models. However, the main weakness of most of these methods is that they are based on the defined parameters, which itself leads to a high sensitivity of the models to variations in the magnitudes of the parameters and, thus, unreliable results. In this paper, we specially address this issue and propose a simple procedure for detecting the right and left RTS classification with an important feature that is independent of any predetermined parameters. In addition to the type of RTS, we also suggest a method to determine the value of the right and left RTS corresponding to each of the efficient DMUs. Finally, the superiority of the proposed parameter-free procedure over a parameter-based methods is elaborated by a real case in the banking system. (C) 2019 Elsevier Ltd. All rights reserved.
Appropriate traffic coordination at road intersections plays an important role in modern intelligent transportation systems (ITS). In this paper, we try to propose a low complexity and scalable intersection coordinati...
详细信息
ISBN:
(纸本)9781728109602
Appropriate traffic coordination at road intersections plays an important role in modern intelligent transportation systems (ITS). In this paper, we try to propose a low complexity and scalable intersection coordination framework based on a five-collision-set model. Aiming at the essential non-convex problem, we try to reformulate the original problem into an mixed binary integer programming (MBIP) one by proper relaxations. Furthermore, the proposed coordination strategy can be easily extended to the complicated multi-lane intersections. Numeric results verifies the feasibility and scalability of the proposed traffic coordination strategy.
In this paper, we consider a flow shop scheduling problem under different conditions. The model is formulated in a form of mixed binary integer programming. The primary goal of this paper is to develop operation sched...
详细信息
In this paper, we consider a flow shop scheduling problem under different conditions. The model is formulated in a form of mixed binary integer programming. The primary goal of this paper is to develop operation schedules that specify the completion time of operations. The objective function of our model is formulated as a minimization of the makespan, the weighted mean flow-time or the weighted mean tardiness. There are several constraints which are involved in our modeling such as the due dates of jobs, the jobs ready times, etc. For these objective functions and constraints, seven mixed binary integer programming models are proposed. We demonstrate the implementation of our proposed models using different numerical examples. As a case study, we apply the proposed models for an information systems development (ISD) center to schedule the ISD projects using some real data. (c) 2006 Elsevier Inc. All rights reserved.
暂无评论