You have 60 places to visit. Who goes where, on which day, in what order?
A rollout across 60 branches starts as 60 addresses in a spreadsheet and a lot of guesswork about who goes where on which day. Paste the list, say how long you spend at each site and how long your working day is, and you get a route plan for the whole job in about a minute — a first draft you can adjust, not a finished timetable.
- Runs from your browser, not our server
- No sign-up
- No watermark
Loading the tool…
How it works
- Press “Load an example” to see a finished plan first, or paste your own sites — one per line, “name, address” (a CSV column of addresses also works).
- Say how long you stay at each site and how many hours a day the team works; the tool works out how many sites fit in a day (you can override it). Optionally add a start point — your office or the hotel — and an average driving speed.
- Press Plan. Read the day-by-day table and the map, then export CSV / KML or print one route sheet per day for the field team.
Why nothing is uploaded
Every operation on this page is done by code running inside your browser tab, using the same engine that renders web pages. The file is read from disk into your tab’s memory, transformed there, and written back out as a download. It is never sent anywhere — not to us, not to a third party.
Verify it yourself
- Open your browser’s developer tools (F12) and select the Network tab.
- Load your file and run the tool.
- The only requests you will see fetch the tool’s own code — and, for a few heavy tools, their open-source engine from a public CDN — plus one small page-view ping to loreatec.jp (page address and title, nothing more). None of them carry your file.
Frequently asked questions
What problem does this actually solve?
Splitting many scattered visits into sensible days. If 60 branches need a technician and one team can do 6 a day, someone has to decide which 6 go together, in what order, and what time they will arrive — normally by hand on a map. This does that in one pass so you can plan headcount, hotels and customer appointments.
Who uses it?
IT rollouts and equipment swaps across branches, installation and kitting rounds, inspections and audits, preventive maintenance, meter reading, and sales trips — anyone with a list of Japanese addresses and a limited number of visits per day.
How are the days and the order calculated?
Sites are clustered geographically into as many days as your capacity needs (k-means on coordinates, then balanced so no day exceeds the limit), and each day’s visits are ordered by nearest-neighbour and improved with 2-opt. Distances are straight-line × 1.3 (a usual road-detour factor); arrival times use the average speed and the minutes per visit you set.
What it is NOT
It is not a routing engine: no live traffic, no road network, no train timetables, no driver shifts or time windows. Treat the result as a good first draft — expect to move a few sites between days by hand.
How accurate is the geocoding?
The GSI address search resolves Japanese addresses to the town / block level (町丁目・番地) in most cities; rural addresses may land on the town centre. Each site shows the matched place name — check anything that looks odd and refine the address (write the prefecture, use half-width numbers). Addresses it cannot find are listed separately instead of being silently dropped.
Can I plan a trip that starts and ends at a hotel?
Yes: give a start point and tick “return to start each day”. The first and last leg of every day are then included in the distance and the timing.
What do I get out?
A table (day, order, site, address, leg km, arrival time), an SVG map coloured by day, CSV for your spreadsheet, KML / GeoJSON to open in Google My Maps, Google Earth or QGIS, and a printable route sheet per day with a tick box and a memo column.
Is anything stored or uploaded?
Your list never leaves your browser: only the individual addresses go to the GSI geocoding API to be turned into coordinates. Those coordinates are cached in your browser (localStorage) so re-planning is instant and offline; “Clear cache” wipes them.