David Simchi-Levi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
David Simchi-Levi has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Julien Bramel
Columbia University
3 shared publicationsLap Mui Ann Chan
University of Toronto, Toronto, Canada
2 shared publicationsEdward G. Coffman
AT&T Bell Laboratories, Murray Hill, New Jersey
1 shared publicationPeter W. Shor
AT&T Bell Laboratories, Murray Hill, New Jersey
1 shared publicationWanSoo T. Rhee
Faculty of Management Science, The Ohio State University, Columbus, Ohio 43210
1 shared publication
Latest Publications
- 1 November 1998
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 44 (11-part-1) , 1562-1576
Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
We consider the problem of integrating inventory control and vehicle routing into a cost-effective strategy for a distribution system consisting of a single outside vendor, a fixed number of warehouses and many geographically dispersed retailers. Each retailer faces a constant, retailer specific, demand rate and inventory holding cost is charged at the retailers and the warehouses. We show that, in an effective strategy which minimizes the asymptotic long run average cost, each warehouse receives fully loaded trucks from the vendor but never holds inventory. That is, each warehouse serves only as a coordinator of the frequency, time and sizes of deliveries to the retailers. This insight is used to construct an inventory control policy and vehicle routing strategy for multi-echelon distribution systems. Computational results are also reported.
- 1 November 1998
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 44 (11-part-1) , 1562-1576
Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
We consider the problem of integrating inventory control and vehicle routing into a cost-effective strategy for a distribution system consisting of a single outside vendor, a fixed number of warehouses and many geographically dispersed retailers. Each retailer faces a constant, retailer specific, demand rate and inventory holding cost is charged at the retailers and the warehouses. We show that, in an effective strategy which minimizes the asymptotic long run average cost, each warehouse receives fully loaded trucks from the vendor but never holds inventory. That is, each warehouse serves only as a coordinator of the frequency, time and sizes of deliveries to the retailers. This insight is used to construct an inventory control policy and vehicle routing strategy for multi-echelon distribution systems. Computational results are also reported.
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1) , 213-227
Worst-case analyses, linear programming and the bin-packing problem
- 1 January 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 83 (1) , 213-227
Worst-case analyses, linear programming and the bin-packing problem
- 1 October 1997
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 44 (7) , 673-686
Average‐case analysis of the bin‐packing problem with general cost structures
- 1 October 1997
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 44 (7) , 673-686
Average‐case analysis of the bin‐packing problem with general cost structures
- 1 December 1992
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 40 (6) , 1095-1106
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
In the capacitated vehicle routing problem with unsplit demands, the demand of a customer may not be divided over more than one vehicle. The objective is to find tours for the vehicles such that the amount delivered by a vehicle does not exceed its capacity, each customer receives its demand, and the total distance traveled is as small as possible. We find the asymptotic optimal solution value of the capacitated vehicle routing problem with unsplit demands for any distribution of the demands when customers are independently and identically distributed in a given region. We also develop polynomial-time heuristics for the problem and show that, under certain assumptions on the distribution of customer locations and demands, the heuristics produce solutions that are asymptotically optimal. In addition, we give a tight bound on the rate of convergence for the case when customers are uniformly distributed in a rectangular region.
- 1 December 1992
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 40 (6) , 1095-1106
Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
In the capacitated vehicle routing problem with unsplit demands, the demand of a customer may not be divided over more than one vehicle. The objective is to find tours for the vehicles such that the amount delivered by a vehicle does not exceed its capacity, each customer receives its demand, and the total distance traveled is as small as possible. We find the asymptotic optimal solution value of the capacitated vehicle routing problem with unsplit demands for any distribution of the demands when customers are independently and identically distributed in a given region. We also develop polynomial-time heuristics for the problem and show that, under certain assumptions on the distribution of customer locations and demands, the heuristics produce solutions that are asymptotically optimal. In addition, we give a tight bound on the rate of convergence for the case when customers are uniformly distributed in a rectangular region.