Interactive Multi-Destination Mapping with Drag-and-Drop Reordering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional map applications are limited to point-to-point solutions, requiring users to break down multi-destination trips into separate entries, leading to inefficiencies and resource waste in creating and printing multiple maps and directions.
Innovation Solution
An interactive mapping method and system that allows users to input and reorder multiple address locations, displaying them graphically on a map with connected routes, enabling drag-and-drop functionality for reordering and removing destinations, and providing features like roundtrip planning, auto-completion, and optimized printing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional map applications use point-to-point solutions for each destination, then users can obtain driving directions for individual trips, but users must create and print multiple separate maps and directions for multi-destination trips, leading to time consumption and resource waste
Solution Approach 1:
The patent merges multiple point-to-point routing operations into a single multi-destination routing operation. Users can input multiple destinations in one interface, and the system generates a single optimized route visiting all locations, producing one consolidated map and direction set instead of multiple separate ones.
Solution Approach 2:
The routing system is enhanced to handle both traditional point-to-point routing and multi-destination routing through a unified interface. The same system serves multiple functions: single trip planning, multi-destination trip planning, and automatic optimization of visit sequences, eliminating the need for separate tools or repeated manual operations.
2Ease of operation
If conventional map applications require separate point-to-point entries for each destination, then users can obtain detailed directions for each segment, but the process becomes complex and resource-intensive for multi-destination trips
Solution Approach 1:
The system combines multiple destination inputs and routing calculations into a single operational workflow. Users enter all destinations in one list, and the system processes them collectively to generate a unified route plan, eliminating the need for multiple separate creation operations.
Solution Approach 2:
The system automatically optimizes the visit sequence to multiple destinations without requiring users to manually plan the order. The algorithm self-adjusts the routing based on the provided destinations, automatically calculating the most efficient path and generating the complete trip plan in one operation.
Data Source
AI summary
Method and computer program product for presenting a set of address locations in a browser window of a user device via the Internet are disclosed. The method includes receiving a set of address locations in a given order, presenting the set of address locations as a list of directions, and presenting the set of address locations graphically on a map, where the map includes a route connecting the set of address locations according to the given order and a marker for each of the address locations. The method further includes creating a new order of the set of address locations from the given order by dragging an address location from the map to a different position in the list of directions, updating the list of directions according to the new order of the set of address locations, and updating the map according to the new order of the set of address locations.


