The Vehicle Routing Problem with Profits and consistency constraints

Stavropoulou, Foteini; Repoussis, Panagiotis P.; Tarantilis, Christos D.

doi:10.1016/j.ejor.2018.09.046

Cited by 50 publications

(19 citation statements)

References 44 publications

(78 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Yet, better solutions might be missed (see Kovacs et al, 2015a), and even more, the optimal solution may be unreachable. Instead of working with template routes, we design a solution strategy that operates on the entire routing plan, an approach that is also used in Kovacs et al (2015aKovacs et al ( , 2015b, Lian et al (2016), Braekers and Kovacs (2016), Stavropoulou et al (2019), and Campelo et al (2019).…”

Section: Literature Reviewmentioning

confidence: 99%

“…In Stavropoulou et al. (2019), ConVRP with Profits was introduced. There are two sets of customers, the frequent customers that are mandatory to service, and the non‐frequent potential customers that are optional, with known and estimated profits, respectively, both having known demands and service requirements over a planning horizon of multiple days.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

A case study of consistent vehicle routing problem with time windows

Lespay

Suchan

2020

Int Trans Operational Res

View full text Add to dashboard Cite

We develop a heuristic for the consistent vehicle routing problem with time windows (ConVRPTW), which is motivated by a real-world application at a food company's distribution center. Besides standard VRPTW restrictions, ConVRPTW assigns each customer just one driver to fulfill his or her orders during the whole multiperiod planning horizon. For each driver and period, a route is sought to serve all their customers with positive demand. For each customer, the number of periods between consecutive orders and the ordered quantities is highly irregular. This causes difficulties in the daily routing, negatively impacting the service level of the company. Similar problems have been studied as ConVRP, where the number of drivers is fixed a priori, and only the total travel time is minimized. Moreover, the clients present no time window constraints, but the visits should be scheduled with a small arrival time variation. In our model, the objective is to minimize the number of drivers. We impose hard time windows but do not consider time consistency in more detail. We compare solutions given by the heuristic with solutions of a mixed-integer linear programming model on a set of small artificial instances and solutions used by the food company on real-world instances. The results show the effectiveness of the heuristic. For the company, we obtain significant improvements in the routing plans, with a lower number of vehicles and a higher rate of orders delivered within the prescribed time window.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

A case study of consistent vehicle routing problem with time windows

Lespay

Suchan

2020

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Problems of bike-sharing systems correlate to the route planning problems and wireless sensor networks security problems (especially IoV security problems). The former problems involve the Vehicle Routing Problem (VRP) [5]- [8], the Multiple Traveling Salesman Problem (mTSP) [9], [10] and Orienteering Problem (OP) [11]- [13]. And the later one involves attack detection [25], [26], [29], trust management [29], and key management problems [30], [31], [34].…”

Section: Related Workmentioning

confidence: 99%

Broken Bike Recycling Planning for Sharing Bikes System

Zhang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Cycling as a green transportation mode has been promoted by many governments all over the world nowadays and bike-sharing systems have been widely used in urban public transportation, because of their convenience and environmental friendliness in recent years. However, due to the high daily usage and lack of effective maintenance, vast piles of broken bikes appear in many big cities. Therefore, building an effective broken bike collection model becomes a crucial task to promote the cycling behavior. In this paper, we bulid a broken sharing bike recycling planning model to collect the broken bikes based on the large scale real-world sharing bike data. We incorporate the realistic constraints to formulate our problem. Finally, we provide extensive experimental results to demonstrate the effectiveness of our approach.

show abstract

“…As one of the hardest problems in operations research, VRP has received considerable attention. For the latest research on VRP, please see the literature [5][6][7][8][9][10][11][12][13][14][15][16][17][18]. For the latest development review, please see the literature [19][20][21].…”

Section: Introductionmentioning

confidence: 99%

A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation

Zeng

Huang

2019

Sustainability

View full text Add to dashboard Cite

In this paper, a home service problem is studied, where a capacitated vehicle collects customers’ parcels in one pick-up tour. We consider a situation where customers, who have scheduled their services in advance, may call to cancel their appointments, and customers, who do not have appointments, also need to be visited if they request for services as long as the capacity is allowed. To handle those changes that occurred over the tour, a dynamic strategy will be needed to guide the vehicle to visit customers in an efficient way. Aimed at minimizing the vehicle’s total expected travel distance, we model this problem as a multi-dimensional Markov Decision Process (MDP) with finite exponential scale state space. We exactly solve this MDP via dynamic programming, where the computing complexity is exponential. In order to avoid complexity continually increasing, we aim to develop a fast looking-up method for one already-examined state’s record. Although generally this will result in a huge waste of memory, by exploiting critical structural properties of the state space, we obtain an O ( 1 ) looking-up method without any waste of memory. Computational experiments demonstrate the effectiveness of our model and the developed solution method. For larger instances, two well-performed heuristics are proposed.

show abstract

The Vehicle Routing Problem with Profits and consistency constraints

Abstract: The version presented here may differ from the published version or from the version of the record. Please see the repository URL above for details on accessing the published version and note that access may require a subscription.

Cited by 50 publications

References 44 publications

A case study of consistent vehicle routing problem with time windows

A case study of consistent vehicle routing problem with time windows

Broken Bike Recycling Planning for Sharing Bikes System

A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation

Contact Info

Product

Resources

About