Implementation Sequence Optimization for Dedicated Bus Lane Projects

2021 ◽  
pp. 036119812110148
Author(s):  
Murat Bayrak ◽  
S. Ilgin Guler ◽  
Paul Schonfeld
Keyword(s):  
Resource Constraints ◽  
Optimal Schedule ◽  
Transmission Model ◽  
Project Duration ◽  
Total Cost ◽  
Transportation Projects ◽  
Bus Lane ◽  
Upper Level ◽  
Demand Patterns ◽  
Total Project

Transportation projects are often implemented in phases, and the total project duration can span years. Optimization of the sequence in which transportation projects are implemented can decrease the severity of disruptions caused by construction, reduce the total cost of projects, and increase the present value of the benefits of the project. This paper presents a method for optimizing the sequence and location of dedicated bus lane implementations. The proposed method is based on a bi-level optimization framework. The lower level simulates the traffic using a link transmission model to evaluate car and bus delays, while the upper level optimizes the locations of bus lanes and/or the implementation sequence of a given bus lane configuration. If the budget or other resource constraints are binding, the optimized sequence uniquely determines the optimal schedule. The solution method is evaluated for a test network, and an analysis of sensitivity to different demand patterns and different bus lane configurations is conducted. First, the optimized locations for bus lane implementation are determined for an illustrative test network. Results suggest that, when considering the implementation sequence for the optimized set of bus lane locations, the sequence of implementation does not yield significant benefits. However, if bus lanes are implemented on every possible link, the results suggest that prioritizing the implementation of bus lanes on peripheral links would reduce the total cost the most. These locations coincide with the set of optimized locations for bus lane implementation. Further tests considering non-uniform demand patterns also confirm these findings.

The Costs of Crashing—A Comment

1971 ◽  
Vol 35 (4) ◽  
pp. 63-66
Author(s):  
Neil E. Beckwith
Keyword(s):  
Project Duration ◽  
Total Cost ◽  
Total Project

This article presents an algorithm for selecting the activities which should be expedited to minimize the total cost of achieving a particular total project duration. The author comments on “The Costs of Crashing” which appeared in the July, 1970 issue of the JOURNAL OF MARKETING.

scholarly journals Optimized Procedure to Schedule Physicians in an Intensive Care Unit: A Case Study

Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 1976
Author(s):  
Lotfi Hidri ◽  
Achraf Gazdar ◽  
Mohammed M. Mabkhot
Keyword(s):  
Intensive Care Unit ◽  
Intensive Care ◽  
Cost Minimization ◽  
Optimal Schedule ◽  
Real Life ◽  
Real Data ◽  
Experimental Tests ◽  
Operating Costs ◽  
Healthcare Personnel ◽  
Total Cost

Hospitals are facing an important financial pressure due to the increasing of the operating costs. Indeed, the growth for the hospitals’ services demand causes a rising in the number of required qualified personnel. Enlarging the personnel number increases dramatically the fixed total cost. Based on some studies, 50% of operating costs in US hospitals are allocated to healthcare personnel. Therefore, reducing these types of costs without damaging the service quality becomes a priority and an obligation. In this context, several studies focused on minimizing the total cost by producing optimal or near optimal schedules for nurses and physicians. In this paper, a real-life physicians scheduling problem with cost minimization is addressed. This problem is encountered in an Intensive Care Unit (ICU) where the current schedule is manually produced. The manual schedule is generating a highly unbalanced load within physicians in addition to a high cost overtime. The manual schedule preparation is a time consuming procedure. The main objective of this work is to propose a procedure that systematically produces an optimal schedule. This optimal schedule minimizes the total overtime within a short time and should satisfies the faced constraints. The studied problem is mathematically formulated as an integer linear program. The constraints are real, hard, and some of them are non-classical ones (compared to the existing literature). The obtained mathematical model is solved using a state-of-the-art software. Experimental tests on real data have shown the performance of the proposed procedure. Indeed, the new optimal schedules reduce the total overtime by up to 69%. In addition, a more balanced workload for physicians is obtained and several physician preferences are now satisfied.

scholarly journals Cost Optimal Project Scheduling

Organizacija ◽  
2008 ◽  
Vol 41 (4) ◽  
pp. 153-158
Author(s):  
Uroš Klanšek ◽  
Mirko Pšunder
Keyword(s):  
Nonlinear Programming ◽  
Objective Function ◽  
Project Scheduling ◽  
Programming Approach ◽  
Project Duration ◽  
Numerical Example ◽  
Activity Duration ◽  
The Cost ◽  
Total Project Cost ◽  
Total Project

Cost Optimal Project SchedulingThis paper presents the cost optimal project scheduling. The optimization was performed by the nonlinear programming approach, NLP. The nonlinear total project cost objective function is subjected to the rigorous system of the activity precedence relationship constraints, the activity duration constraints and the project duration constraints. The set of activity precedence relationship constraints was defined to comprise Finish-to-Start, Start-to-Start, Start-to-Finish and Finish-to-Finish precedence relationships between activities. The activity duration constraints determine relationships between minimum, maximum and possible duration of the project activities. The project duration constraints define the maximum feasible project duration. A numerical example is presented at the end of the paper in order to present the applicability of the proposed approach.

Application of #Chain Equations to Resource Scheduling

2013 ◽  
Vol 824 ◽  
pp. 544-552
Author(s):  
U.J. Udosen
Keyword(s):  
Resource Availability ◽  
Resource Constraints ◽  
Resource Scheduling ◽  
The Other ◽  
Project Duration ◽  
Network Diagrams

Chain (pronounced number chain) equations were applied in the resource scheduling of two projects. The first project involved the scheduling of one type of manpower with unlimited resource availability while the second involved categorized manpower with resource constraints. The Earliest Start (ES), Latest Start (LS) and Leveling methods were applied to schedule the first project and were characterized by plotting network diagrams to schedule the project. When the #Chain approach was employed to schedule the same project, plotting of network diagrams was obviated but yielded similar manpower profiles and project duration of 12 weeks as the other methods. The ES, LS and Leveling methods did not lend themselves to scheduling of the project with categorized manpower having constraints and were not applied for scheduling the second project. However, the #Chain equations were applied, with ease, to schedule the second project to generate manpower profiles for each type of manpower. Due to the constraints applied, the project duration was extended from 12 weeks to 14 weeks. Hence the #Chain approach proffers a simple and preferred methodology for scheduling categorized resources with their attendant constraints.

scholarly journals Approach to intellectualization of complete supply chain management processes using fuzzy expert systems

2021 ◽  
pp. 26-39
Author(s):  
Yuri Romanenkov ◽  
◽  
Yashar Rahimi ◽  
Mariia Danova ◽  
Olena Feoktystova ◽  
...  
Keyword(s):  
Decision Making ◽  
Network Model ◽  
Petri Net ◽  
Business Processes ◽  
Resource Constraints ◽  
Raw Materials ◽  
Central Element ◽  
Typical Food ◽  
Upper Level ◽  
Fuzzy Network

”. It is shown that in order to increase the efficiency of the functioning of complete logistical supply chains (CLSC), it is necessary to develop special methodological tools, and, on their basis, software to facilitate decision-making on the timely formation of liquid consignments at the terminal sections of the chain of liquid goods. The article describes a fuzzy network of CLSC in the form of a hierarchical two-level nested Petri net (NPN), the upper level of which reproduces the process of functioning of the focal company as the central element of the CLSC, and each of the components of the lower level of the network model is an elementary Petri net reflecting the logistic processes at the terminal sections of the CLSC production of raw materials and sale of finished products. This article also gives a description of the procedure for creating a fuzzy network model for representing information about business processes that take place during the functioning of the CLSC, taking into account the existing time and resource constraints, in the form of a NPN, which is expanded by introducing fuzzy and temporal statements. Special methods of automated decision- making on the sustainable functioning of CLSCs are described and justified in terms of making a choice on the transport mode and optimal routing. Based on the developed methodological tools, the process of forming and providing the stable functioning of the CLSC for typical food products of the grocery group, namely dried fruits, is considered.

scholarly journals Research on Multi-objective Optimization of Substation Project Management Based on Resource Constraint

2021 ◽  
Vol 261 ◽  
pp. 01055
Author(s):  
Xichu Zhou ◽  
Li Sun ◽  
Sixia Fan ◽  
Bin Wu
Keyword(s):  
Project Management ◽  
Resource Constraints ◽  
Rapid Development ◽  
Multi Objective Optimization ◽  
Gradual Improvement ◽  
Project Duration ◽  
Multi Objective ◽  
Optimal Resource ◽  
Electricity Load ◽  
Engineering Projects

With the rapid development of China’s economy, the electricity load continues to increase, the national demand for power engineering projects is also increasing.In the context of the gradual improvement of national requirements for substation projects, decision makers no longer only consider the optimal standards of project duration, cost and quality, but also the resources consumed in the construction and the degree of impact on the environment are important criteria for judging projects.However, in order to be environment-friendly and based on resource constraints, the project management of substation projects is becoming more and more complicated.In this paper, resource factors are added on the basis of the three classical indexes, and the optimal resource allocation of the project is realized under the condition of minimizing the adverse impact on the environment. The feasibility scheme of multi-objective optimization is obtained through particle swarm optimization algorithm.

Dynamic Origin-Destination Demand Estimation with Multiday Link Traffic Counts for Planning Applications

2003 ◽  
Vol 1831 (1) ◽  
pp. 30-38 ◽  
Author(s):  
Xuesong Zhou ◽  
Xiao Qin ◽  
Hani S. Mahmassani
Keyword(s):  
Real Time ◽  
Demand Estimation ◽  
Test Bed ◽  
Estimation Model ◽  
Interactive Approach ◽  
Traffic Demand ◽  
Level Problem ◽  
Upper Level ◽  
Demand Patterns

A dynamic origin–destination demand estimation model for planning applications with real-time link counts from multiple days is presented. Based on an iterative bilevel estimation framework, the upper-level problem is to minimize both the deviation between estimated link flows and real-time link counts and the deviation between estimated time-dependent demand and given historical static demand. These two types of deviations are combined into a weighted objective function, where the weighting value is determined by an interactive approach to obtain the best compromise solution. The single-day formulation is further extended to use link counts from multiple days to estimate the variation in traffic demand over multiple days. A case study based on the Irvine test bed network is conducted to illustrate the methodology and estimate day-to-day demand patterns. The application illustrates considerable benefits in analyzing the demand dynamics with multiday data.

An Improved Production Scheduling Algorithm Based on Resource Constraints

2013 ◽  
Vol 455 ◽  
pp. 619-624
Author(s):  
Yan Gao ◽  
Xin Zhang ◽  
Jian Zhong Xu
Keyword(s):  
Production Scheduling ◽  
Resource Constraints ◽  
Critical Path ◽  
Constraint Satisfaction Problem ◽  
Scheduling Algorithm ◽  
Mathematics Model ◽  
Scheduling Problems ◽  
Project Duration ◽  
Aircraft Assembly ◽  
Two Stages

For resource-constrained project scheduling problems, with aircraft assembly as its background, we established its mathematics model as constraint satisfaction problem. An improved critical path scheduling algorithm is proposed, considering the constraints of precedence relations, resource constraints and space constraints, through the two stages of planning, reaching for aircraft assembly task scheduling optimization objectives. Through the given numerical example results show that, when the objective consists in minimizing the project duration, the algorithm has better performance.

Selective maintenance optimization under schedule and quality constraints

2016 ◽  
Vol 33 (7) ◽  
pp. 1030-1059 ◽  
Author(s):  
Pravin P Tambe ◽  
Makarand S Kulkarni
Keyword(s):  
Quality Control ◽  
Production Scheduling ◽  
Optimal Schedule ◽  
Integrated Approach ◽  
Computational Time ◽  
Shop Floor ◽  
Content Type ◽  
Total Cost ◽  
Selective Maintenance ◽  
Expected Total Cost

Purpose – The traditional practice for maintenance, quality control and production scheduling is to plan independently irrespective of an interrelationship exist between them. The purpose of this paper is to develop an approach for integrating maintenance, quality control and production scheduling. The objective is to investigate the benefits of the integrated effect in terms of the expected total cost of system operation of the three functions. Design/methodology/approach – The proposed approach is based on the conditional reliability of the components. Cost model for integrating selective maintenance, quality control using sampling-based procedure and production scheduling is developed using the conditional reliability. An integrated approach is such that, first an optimal schedule for the batches to be processed is obtained independently while the maintenance and quality control decisions are optimized considering the optimal schedule on the machine. The expected total cost of conventional approach, i.e. “No integration” is calculated to compare the effectiveness of integrated approach. Findings – The integrated approach have shown a higher cost saving as compared to the independent planning approach. The approach is practical to implement as the results are obtained in a reasonable computational time. Practical implications – The approach presented in this paper is generic and can be applied at planned as well as unplanned opportunities. The proposed integrated approach is dynamic in nature, as during maintenance opportunities, it is possible to optimize the decision on maintenance, quality control and production scheduling considering the current age of components and production requirement. Originality/value – The originality of the paper is in the approach for integration of the three elements of shop floor operations that are usually treated separately and rarely touched upon by researchers in the literature.

Sign in / Sign up

Export Citation Format

Share Document