The Team Orienteering Problem with Capacity Constraint and Time Window
نویسندگان
چکیده
The Team Orienteering Problem (TOP) is defined as to find a set of vehicle walks such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle walk is restricted by a pre-specified limit. The team orienteering problem with capacity constraint and time window(TOPCT) is an extension of the TOP where each customer has a demand and a time window, each customer must be visited in the given time window and the capacity of each vehicle is limited. In this paper, we first formulate the TOPCT problem into an integer linear programming based on network flow theory and solve it to obtain the exact optimal solution. Then we give computational results which demonstrate the efficient of the model and algorithm.
منابع مشابه
Solving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملSolving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
متن کاملWell-Tuned ILS for Extended Team Orienteering Problem with Time Windows
The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Team Orienteering Problem (TOP) by incorporating the time window constraints. Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a fixed number of routes considering a predefined time window during which the service has to start. In t...
متن کاملOrienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs
Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective func...
متن کاملHome Health Care Delivery Problem
We address the Home Health Care Delivery Problem (HHCDP), which is concerned with staff scheduling in the home health care industry. The goal is to schedule health care providers to serve patients at their homes that maximizes the total collected preference scores from visited patients subject to several constraints, such as workload of the health care providers, time budget for each provider a...
متن کامل