Abstract
This paper discusses bookkeeping strategies for solving large MOLPs on ADBASE, a popular sequential software package, and on a parallel ADBASE algorithm. Three representative list creation schemes were first analysed and tested. The best of them, Binary Search with Insertion Sort (BSIS), was incorporated into ADBASE and the parallel ADBASE algorithm. These revised versions were compared with their standard counterparts on a series of test problems, and their computation times were compared. The results show that the new bookkeeping strategy for maintaining a list of efficient solutions significantly speeds up the process of solving MOLPs, especially on parallel computers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
