The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the recreational vehicle rental business, the problem of preparing a schedule for each vehicle in the fleet (by assigning accepted bookings to available vehicles over the planning horizon) is known as the recreational vehicle scheduling problem (RVSP). The problem belongs to the class of minimum cost multicommodity network flow problems which is known to be NP-hard. A formulation of the RVSP from...
In this paper, we propose a deterministic optimization model for selecting and scheduling a fleet of buses in a private transportation system where buses are to be assigned to serve employees and their families on different trips along different routes from the main campus and residential compound. The paper describes the development of an integer programming formulation as a tool to help in the decision...
As the population in Indonesia grows, the need of energy in forms of fuel, electricity, asphalt, or wax which were distilled through the refinery process of crude oil, has been consistently increasing for the past several years. In addition, with the continuous entrance of foreign companies penetrating the Indonesia gas market, increases the stringent of the competition. In order to be able to stay...
This paper compares two valid mathematical formulations for solving a routing problem related to Personal Rapid Transit(PRT). The PRT is an innovative automated transportation system that provides an on-demand transportation service for its users. This is made possible by the use of small electric driverless vehicles. Our objective is to determine the mathematical formulation that minimizes the total...
Cross-docking is a logistics approach where products from a supplier or manufacturer can be moved directly to customers or retailers without handling or storage time. In this paper, a distribution planning problem with the cross-docking centers is taken into account. A new two-stage mathematical model is formulated to minimize total costs in the multi-echelon network for the cross-docking center location...
A multi-objective 0-1 integer programming model is established in order to solve the complex problem of cast batch planning for steelmaking and continuous casting which is considered as vehicle routing problem. To solve the complex multi-constrained, multi-objective cast batch planning model for steelmaking and continuous casting, a method is proposed which combines rules with ant colony algorithm...
This paper presents a method to solve the optimal scheduling problem of Automated Guided Vehicles (AGVs). The problem is formulated into an integer programming problem by focusing a summation of idling time when an AGV does not operate any dispatching commands of transportation. However, there remains undecided constants exist in some constraints. Therefore, we propose a multistep algorithm to solve...
Certain types of food such as catering foods decay very rapidly. This paper investigates how the quality of such foods can be improved by shortening the time interval between production and delivery. To this end, we develop an approach which integrates short-term production and distribution planning in a novel iterative scheme. The production scheduling problem is solved through an MILP modeling approach...
In mass transit scheduling, the number of precompiled potential shifts would be extremely large, usually more than the exponential of the number of potential spells. To solve the integrated vehicle and crew scheduling problem (ISP) without the aid of precompiled potential shifts, a spell-based integer linear programming (ILP) model is proposed. The model can deal with the ISP with multi-depots. The...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.