登入選單
返回Google圖書搜尋
註釋The trip packing problem is the problem of assigning a number of trips to a fleet of vehicles. Each trip has a specific duration and the working time of vehicles is limited. This paper considers a version the trip packing problem where the fleet is composed of a limited number of non identical vehicles and the revenue of each trip depends on the vehicle selected to do it. The paper provides a mathematical formulation of the problem and proposes some simple local search heuristics to solve it. A set of benchmark problem instances is created and used to analyse the performance of the propos.