Pickup and Delivery of Partial Loads with “Soft” Time Windows

Sexton, Thomas R.; Choi, Young-Myung

doi:10.1080/01966324.1986.10737200

Cited by 67 publications

(28 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both penalty functions are in line with the linear inconvenience functions proposed by Sexton and Choi (1986), and Toth and Vigo (1997). Bergvinsdottir et al (2004) also use a piecewise linear function with increasing slopes depending on the arrival time at each destination location.…”

Section: Constraints and Objectivementioning

confidence: 71%

Dynamic transportation of patients in hospitals

Beaudry¹,

et al. 2008

View full text Add to dashboard Cite

This paper analyzes and solves a patient transportation problem arising in several large hospitals. The aim is to provide an efficient and timely transport service to patients between several locations on a hospital campus. Transportation requests arrive in a dynamic fashion and the solution methodology must therefore be capable of quickly inserting new requests in the current vehicle routes. Contrary to standard dial-a-ride problems, the problem under study contains several complicating constraints which are specific to a hospital context. The paper provides a detailed description of the problem and proposes a two-phase heuristic procedure capable of handling its many features. In the first phase a simple insertion scheme is used to generate a feasible solution, which is improved in the second phase with a tabu search algorithm. The heuristic procedure was extensively tested on real data provided by a German hospital. Results show that the algorithm is capable of handling the dynamic aspect of the problem and of providing high quality solutions. In particular, it succeeded in reducing waiting times for patients while using fewer vehicles.

show abstract

Section: Constraints and Objectivementioning

confidence: 71%

Dynamic transportation of patients in hospitals

Beaudry¹,

et al. 2008

View full text Add to dashboard Cite

show abstract

“…Theoretical studies for the single-vehicle case include the work by Psaraftis (1980Psaraftis ( , 1983a, Bodin (1985a, 1985b), Sexton and Choi (1986), Desrosiers et al (1986) for exact algorithms and the work of Psaraftis (1983bPsaraftis ( , 1983c for heuristic approaches. Stein (1978aStein ( , 1978b) developed a probabilistic analysis of the problem, and Daganzo (1978) presented a model to evaluate the performance of a dial-a-ride system.…”

Section: Introductionmentioning

confidence: 99%

A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

Diana

Dessouky

2004

Transportation Research Part B: Methodological

188

View full text Add to dashboard Cite

“…A benchmark study is done by Nazif and Lee (2010) on VRP with Time Windows (VRPTW) and solves it with genetic algorithm approach. Another studies that have considered vehicle routing problem with time window constraints and have constructed penalty costs to reflect violation of these time windows can be seen in Koskosidis et al, 1992;and Sexton and Choi, 1986. We depict the relationship between penalty cost and arrival time in Fig.…”

Section: Relaxation Time Windowsmentioning

confidence: 99%

Implementation Weather-Type Models of Capacitated Arc Routing Problem via Heuristics

Ismail¹,

Ramli

2011

American Journal of Applied Sciences

View full text Add to dashboard Cite

Problem statement:In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle's operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did not increase in volumes, but in weights due to rain drops. Consequently, this matter thus burdened vehicle's capacity and prolonged its operation time. This dynamic variable thus changes the initial CARP model where the existing model did not consider other external elements that have effected onto the model. Approach: Then we developed and enhanced CARP by integrating stochastic demand and time windows to suit the models with our specific case. Results: Objectively, CARP with stochastic demand (CARPSD) and CARP with time windows (CARPTW) were designed to minimize the total routing cost and number of trips for a vehicle. Our approach is to design CARP models in almost likely to road layout in residential area and graphically this model is called mesh network. We also developed a constructive heuristic that is called nearest procedure based on highest demand/cost (NPHDC) and work in conjunction with switching rules to search the feasible solution. Conclusion: Our preliminary results show a higher cost and more trips are needed when the vehicle operates in rainy day compared to normal day operation.

show abstract

Pickup and Delivery of Partial Loads with “Soft” Time Windows

Cited by 67 publications

References 15 publications

Dynamic transportation of patients in hospitals

Dynamic transportation of patients in hospitals

A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

Implementation Weather-Type Models of Capacitated Arc Routing Problem via Heuristics

Contact Info

Product

Resources

About