exact methods

An exact price-cut-and-enumerate method for the capacitated multi-trip vehicle routing problem with time windows

  • Yu Yang
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Transportation Tags , , ,

    We consider the capacitated multi-trip vehicle routing problem with time windows (CMTVRPTW), where vehicles are allowed to make multiple trips. The ability to perform multiple trips is necessary for some real-world applications where the vehicle capacity, the trip duration, or the number of drivers or vehicles is limited. However, it substantially increases the solution difficulty … Read more

    Bin Packing Problem with Time Dimension: An Application in Cloud Computing

  • Nursen Aydin
  • Ş. İlker Birbil
  • Ibrahim Muter
    • Categories Applications - OR and Management Sciences Tags , , , ,

    Improving energy efficiency and lowering operational costs are the main challenges faced in systems with multiple servers. One prevalent objective in such systems is to minimize the number of servers required to process a given set of tasks under server capacity constraints. This objective leads to the well-known bin packing problem. In this study, we … Read more