Skip to main content
Log in

On the nucleolus of the basic vehicle routing game

  • Published:
Mathematical Programming Submit manuscript

Abstract

In the vehicle routing cost allocation problem the aim is to find a good cost allocation method, i.e., a method that according to specified criteria allocates the cost of an optimal route configuration among the customers. We formulate this problem as a co-operative game in characteristic function form and give conditions for when the core of the vehicle routing game is nonempty.

One specific solution concept to the cost allocation problem is the nucleolus, which minimizes maximum discontent among the players in a co-operative game. The class of games we study is such that the values of the characteristic function are obtained from the solution of a set of mathematical programming problems. We do not require an explicit description of the characteristic function for all coalitions. Instead, by applying a constraint generation approach, we evaluate information about the function only when it is needed for the computation of the nucleolus.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Balas, “The prize collecting traycling salesman problem,”Networks 19 (1989) 621–636.

    MATH  MathSciNet  Google Scholar 

  2. M.L. Balinski and R.E. Quandt, “On an integer program for a delivery problem,”Operations Research 12 (1964) 300–304.

    Google Scholar 

  3. L. Bodin, B. Golden, A. Assad and M. Ball, “Routing and scheduling of vehicles and crews: The state of the art,”Computers & Operations Research 10 (1983) 62–212.

    MathSciNet  Google Scholar 

  4. N. Christofides and S. Eilon, “An algorithm for the vehicle dispatching problem,”Operational Research Quarterly 20 (1969) 309–318.

    Google Scholar 

  5. M. Desrochers, J. Desrosiers and M. Solomon, “A new optimization algorithm for the vehicle routing problem with time windows,”Operations Research 40 (1992) 342–354.

    MATH  MathSciNet  Google Scholar 

  6. I. Dragan, “A procedure for finding the nucleolus of a cooperativen person game,”Zeitschrift für Operations Research 25 (1981) 119–131.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Dror, “Cost allocation: The traveling salesman, binpacking, and the knapsack,”Applied Mathematics and Computation 35 (1990) 191–207.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Fischetti and P. Toth, “An additive approach for the optimal solution of the prize-collecting travelling salesman problem,” in: B.L. Golden and A.A. Assad. (Eds.)Vehicle Routing: Methods and Studies, Studies in Management Science and Systems vol. 16, (North-Holland, Amsterdam, 1988) pp. 319–344.

    Google Scholar 

  9. P.C. Gilmore, R.E. Gomory, “A linear programming approach to the cutting stock problem,”Operations Research 9 (1961) 849–859.

    MATH  MathSciNet  Google Scholar 

  10. B.L. Golden and A.A. Assad, eds.,Vehicle Routing: Methods and Studies, Studies in Management Science and Systems, Vol. 16 (North-Holland, Amsterdam, 1988).

    MATH  Google Scholar 

  11. A. Hallefjord, R. Helmig and K. Jörnsten, “Calculation of the nucleolus when the characteristic function is given implicitly: A constraint generation approach,” Internal Report, Chr. Michelsen Institute, Bergen, Norway (1988).

    Google Scholar 

  12. A. Kopelowitz, “Computation of the kernels of simple games and the nucleolus ofn person games,” Research Memorandum No. 31, Department of Mathematics, The Hebrew University of Jerusalem (1967).

  13. G. Laporte and S. Martello, “The selective travelling salesman problem,”Discrete Applied Mathematics 26 (1990) 193–207.

    Article  MathSciNet  MATH  Google Scholar 

  14. S. Martello and P. Toth, “An upper bound for the zero-one knapsack problem and a branch and bound algorithm,”European Journal of Operational Research 1 (1977) 169–175.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Maschler, B. Peleg and L.S. Shapley, “Geometric properties of the kernel, nucleolus, and related solution concepts,”Mathematics of Operations Research 4 (1979) 303–338.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. Schmeidler, “The nucleolus of a characteristic function game,”SIAM Journal on Applied Mathematics 17 (1969) 1163–1170.

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Tamir, “On the core of a traveling salesman cost allocation game,”Operations Research Letters 8 (1989) 31–34.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maud Göthe-Lundgren.

Additional information

This research has been financed by grants from the Swedish Transportation Research Board (TFB), Dnr 92-97-43. It was performed in part while the first author was a guest researcher at GERAD, École des Hautes Études Commerciales in Montréal, Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Göthe-Lundgren, M., Jörnsten, K. & Värbrand, P. On the nucleolus of the basic vehicle routing game. Mathematical Programming 72, 83–100 (1996). https://doi.org/10.1007/BF02592333

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592333

Keywords

Navigation