Vrptw işler
I need to build a VRP model with date window for each location. In addition, each vehicle will stay at each location during the date window. Program entries: - Number of vehicles - Number of depots - Number of clients - Location of depots & clients (latitude and longitude in Google Maps) - Time window is dates entered in the form dd/mmm/yyyy
We have a need of a simple and straight forward application to solve a Veichle Routing...Lat/Long locations should be shown on a Map (over a browser) for the user to accept, edit or remove the locations from the optimization that will take place after the visual check. -> The APP should be ready to be used by at least 10 users at the same time. -> After the Optimization takes place should be sent an email for each user with the sequence of locations according to the solution of the VRPTW with the respective WAZE link for turn by turn navigation. We already have this workflow in use for one van so that our main goal is to allow the replication of it for a bunch of new drivers to escalate the operation. It is our intention to receive the source code, once the app is fini...
I need a professional analysis of a journal related to heuristic and Optimization algorithms , specifically the Vehicle routing problem with time windows (VRPTW). You must be an expert in heuristic, metaheuristics and optimization algorithms. The report must be written in Latex, it should be 3 pages and should contain: 1) An Introduction that contains a summery of the paper 2) Analysis of the techniques used in the paper (Analyze heuristic method itself) 3) What you think about the paper (quality) 4) Analysis of computational results I'll send the paper after the bid accepted.
The main problem of ...database, also the lat and long. I need to group the addresses in groups of 5 so a taxi (5 capacity) will know who is going with each driver and in wich order, with a logic so the passengers will not be inside taxi more then 90 minutes. Method: first we need to apply a clustering to the addresses k-means clustering to define groups, then we will apply an algorithm like Dijkstra's or macs-vrptw (ant colony) to define order and itinerary withing the group, both sourses are available in google. All this as to be manage with a csv uploader and google map. If there another option or developers with this type of experience, will be more appriciated then other bids Looking to start ASAP, best regards. The full documentation will be shortly in clari...
The main problem of ...database, also the lat and long. I need to group the addresses in groups of 5 so a taxi (5 capacity) will know who is going with each driver and in wich order, with a logic so the passengers will not be inside taxi more then 90 minutes. Method: first we need to apply a clustering to the addresses k-means clustering to define groups, then we will apply an algorithm like Dijkstra's or macs-vrptw (ant colony) to define order and itinerary withing the group, both sourses are available in google. All this as to be manage with a csv uploader and google map. If there another option or developers with this type of experience, will be more appriciated then other bids Looking to start ASAP, best regards. The full documentation will be shortly in clari...
...manager will be able to know who need a taxi after office hour or to pick up 1d All the grouped addresses has to have an itinerary for each taxi (5 person capacity) so system has to make a matrix for all points in the map and save the kms in road from eah point to point , ex: point (a,b) (a,c) (a,d).... Second part: MAke and itinerary for each taxi effectibly using a simple algoithm (macs-vrptw check in google) this part is the most important, if somebody has the method, with sample, will win this project, depending if you can show me a sample i will start asap. Restrictions: max5 person per taxi, and a person has to be 90 minutes max inside taxi After Grouping i need to send notifications to some profiles, the project has to have different profiles, user and pas...
...North-West of England. We identify outsourcing as a key component and are looking to develop good working relationships with quality organisations and individuals. Further details can be viewed @ Projects Overview AiMeS is currently involved in a number of projects that involve mathematical optimisation. A number of these projects fall within the Vehicle Routing with Time Windows (VRPTW) classification of problem. Whilst finding solutions (not optimality) for each project is ideal it is intended to eventually develop software components that can be readily re-used for subsequent projects. More details of the exact nature of all the projects will be given to the potential candidates. AiMeS has access to parallel computational facilities and expertise and it is possibly envisaged
