[PDF] Top 20 A novel approach to independent taxi scheduling problem based on stable matching

... Dial-A-Ride Problem (DARP), which falls into the broader category of classic Vehicle Routing Problems (VRP), or the Traveling Repair Problem (TRP) (Cordeau and Laporte ...their taxi services (Liao ... See full document

... on-demand taxi dispatching platforms is task assignment, which designs matching policies among dy- namically arrived drivers (workers) and passengers ...Previous matching policies maximize the profit ... See full document

... be based on principles of stable ...not-occupied taxi mileage improvement, the average total mileage and the average passenger waiting time ...their approach inspired this study to apply the ... See full document

... a novel solution algorithm which takes advantage of the relationship between traveling salesman and assignment problems which are famous problems of combinatorial optimization area is ...proposed approach ... See full document

... the problem to be optimized as a wavy mirror in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave ...the problem and the artificial image is formed ... See full document

... In this paper, we first proposed a grammar induction method based on Expectation Maximization (EM) algorithm. After representing the extracted knowledge in the form of nested finite automata, a recursive model was ... See full document

... This paper deals with describing a simple formalism that allows agents in a multi-agent system, that have only local knowledge, to share and process context-related information and to solve problems by using context ... See full document

... AS problem in a surgery department aiming to minimize the patients’ length of stay in waiting list was presented by Arenas et ...The problem was defined as a single-stage/multi-server ...estimated ... See full document

... probability distribution with 100 observations of the ran- dom parameters, has 14 861 rows, 48 504 decision variables and 383 131 nonzero coefficients. The model has 695 ran- dom parameters (but only a fraction of these ... See full document

... and scheduling problem for a general transportation network with multiple hazmat classes when incident probabilities are unknown or ...the problem properties, the method of obtaining route flows from ... See full document

... programming problem, the coefficients in both objective functions and constraints are deterministic or ...the problem are uncer- ...programming problem, whose coefficients of both objective functions or ... See full document

... hybrid approach was put forward. The approach had been tested by a large number of simulation cases and practical ...hybrid approach was powerful for complex JSP [11] ... See full document

... The problem of task scheduling in distributed systems is known as an NP-hard problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal ... See full document

... Fault-tolerant Scheduling Algorithm for Precedence Constrained Tasks, [3] failure in a heterogeneous system is ...Tolerant Scheduling in Multicore Systems, [4] presents a hardware based algorithm ... See full document

... rostering problem example [21], VNS is hybridized with integer program- ...this approach a greedy heuristic is employed to tackle the initial problem and create a base solution, which is successfully ... See full document

... Given matching µ, we call µ(s) student s’s match and µ(C) college C’s ...A matching µ is individually rational if neither a student nor a college would be better off by breaking a current match, ...a ... See full document

... Fig. 4. Percentage of SRI instances with stable matchings as we vary probability that agents find each other acceptable. On the left n is even and on the right n is odd. The x-axis is a logscale of n.p, i.e. ... See full document

... Tabu Search is a mainly local search technique that also examines the feasible solution space one point at a time. In addition to the three basic requirements of Simulated Annealing it also requires (4) a list of ... See full document

... After this technique is introduced by considering the taxicab problem, it is used on the actual micro-CHP problem. As a decision here consists of determining which micro-CHPs are turned on and off in the ... See full document

... special problem of servicing patients or elderly people and proposed four modifications of meta-heuristic solution approaches for this ...hybrid approach, combining an exact constraint programming algorithm ... See full document