A goal programming approach to vehicle routing problems with soft time windows

Calvete, Herminia I.; Galé, Carmen; Oliveros, María-José; Sánchez-Valverde, Belén

doi:10.1016/j.ejor.2005.10.010

Cited by 110 publications

(53 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Calvete et al [6] consider a general medium-sized VRPSTW and propose a goal programming model. Aside from minimizing the operational cost and time window violations, the authors consider avoiding underutilization of vehicles and labor.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

A Vehicle Routing Problem with Flexible Time Windows

Taş

Jabali

Woensel

2014

Computers & Operations Research

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

“…The constraints (4) ensure that the vehicle capacity is not exceeded. The constraints (5) and (6) indicate that each vehicle route starts and terminates at the depot. The constraints (7) represent the relationship between the starting time of service at a customer and the departure time of vehicle from its predecessor.…”

Section: Model Formulationmentioning

confidence: 99%

A Vehicle Routing Problem with Flexible Time Windows

Taş

Jabali

Woensel

2014

Computers & Operations Research

View full text Add to dashboard Cite

“…The proposed method finds the optimal solution for small instances and results for ten larger test instances are reported. Calvete et al [20] developed a MIP model for the VRP with hard and soft time windows, a heterogeneous fleet of vehicles and multiple objectives. To solve the problem they suggest a two-phase approach where the first phase enumerates the feasible routes and computes the total penalty incurred by each route due to deviations from targets.…”

Section: Fleet Composition and Routing Problem With Time Windowsmentioning

confidence: 99%

Industrial aspects and literature survey: Fleet composition and routing

Hoff

Andersson

Christiansen

et al. 2010

Computers & Operations Research

301

150

View full text Add to dashboard Cite

The purpose of this paper is to describe industrial aspects of combined fleet composition and routing in maritime and road-based transportation, and to present the current status of research in the form of a comprehensive literature review. With a backdrop of industrial aspects, a categorized survey of relevant literature since the first published papers in the 1950's is given. First, the literature review discusses some early seminal and application-oriented papers, presents a classification of problems, and then focuses on a basic definition of combined fleet composition and routing: the fleet size and mix vehicle routing problem. Three basic mathematical formulations from the literature are presented and compared. Further, the literature of extended and related problems is described and categorized. Surveys of application oriented research in road-based and maritime transportation conclude the review. Finally, we contrast the literature with aspects of industrial applications from a critical, but constructive stance. Major issues for future work are suggested.

show abstract

“…Usually, in reality, the aspiration level of objectives is imprecise for the DMs. The mathematical model in the VRP with soft time windows (VRPSTW) using a GP method is presented in Calvete et al (2007). The proposed solution procedure consists of two steps.…”

Section: Introductionmentioning

confidence: 99%

Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

Yousefi¹,

Tavakkoli–Moghaddam²,

Oliaei³

et al. 2017

10.5267/j.ijiec

View full text Add to dashboard Cite

A vehicle routing problem with time windows (VRPTW) is an important problem with many real applications in a transportation problem. The optimum set of routes with the minimum distance and vehicles used is determined to deliver goods from a central depot, using a vehicle with capacity constraint. In the real cases, there are other objective functions that should be considered. This paper considers not only the minimum distance and the number of vehicles used as the objective function, the customer's satisfaction with the priority of customers is also considered. Additionally, it presents a new model for a bi-objective VRPTW solved by a revised multi-choice goal programming approach, in which the decision maker determines optimistic aspiration levels for each objective function. Two meta-heuristic methods, namely simulated annealing (SA) and genetic algorithm (GA), are proposed to solve large-sized problems. Moreover, the experimental design is used to tune the parameters of the proposed algorithms. The presented model is verified by a real-world case study and a number of test problems. The computational results verify the efficiency of the proposed SA and GA.

show abstract

A goal programming approach to vehicle routing problems with soft time windows

Cited by 110 publications

References 24 publications

A Vehicle Routing Problem with Flexible Time Windows

A Vehicle Routing Problem with Flexible Time Windows

Industrial aspects and literature survey: Fleet composition and routing

Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

Contact Info

Product

Resources

About