- Full text PDF available (34)
- This year (6)
- Last 5 years (29)
- Last 10 years (36)
Journals and Conferences
Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for… (More)
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real time. It discusses some general issues as well as solution strategies.
In the Dial-a-Ride Problem (DARP), a fleet of vehicles must serve transportation requests made by users that need to be transported from an origin to a destination. In this paper we develop the first exact algorithm which is able to either efficiently prove the infeasibility or to provide a feasible solution. Such an algorithm could be used in a dynamic… (More)
This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures which are executed sequentially.… (More)
The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are constructed by fixing a threshold revenue π and then choosing all products with revenue at least π. This is… (More)
Deciding whether or not a feasible solution to the Traveling Salesman Problem with Pickups and Deliveries (TSPPD) exists is polynomially solvable. We prove that counting the number of feasible solutions of the TSPPD is hard by showing the problem is #P-complete.
Social influence has been shown to create significant unpredictability in cultural markets, providing one potential explanation why experts routinely fail at predicting commercial success of cultural products. As a result, social influence is often presented in a negative light. Here, we show the benefits of social influence for cultural markets. We present… (More)
A durable good is a long-lasting good that can be consumed repeatedly over time, and a duropolist is a monopolist in the market of a durable good. In 1972, Ronald Coase conjectured that a duropolist who lacks commitment power cannot sell the good above the competitive price if the time between periods approaches zero. Coase’s counterintuitive conjecture was… (More)
In the Pickup and Delivery Problem (PDP) a fleet of vehicles must serve customers requests which consist of transporting objects from their origins to their destinations. We introduce the PDP with Fixed Partial Routes (PDP-FPR), in which some partial routes are given, and the problem consists in obtaining a solution (a set of routes) which include those… (More)
Social influence is ubiquitous in cultural markets and plays an important role in recommendations for books, songs, and news articles to name only a few. Yet social influence is often presented in a bad light, often because it supposedly increases market unpredictability. Here we study a model of trial-offer markets, in which participants try products and… (More)