864 resultados para vehicle scheduling


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Attached is the Equipment and Vehicle Purchase Report for Fiscal Year 2008 as required by Iowa Code section 307.47. The report is sorted by our accounting object codes. The object codes help you sort the equipment into general categories. The following list will help you understand the codes: Object Description 701 Self Propelled Vehicles 702 Road Equipment & Trailers 703 Large Office Furniture & Files 704 Shop Tools & Small Equipment 705 Engineer, Survey & Measuring Equipment 706 Copiers, Fax & Communication Equipment 707 Computers & Related Equipment

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motor Vehicle Crash Fatalities

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.